./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 aee5edffc06a346ddce4a9cfa75b4213bee8ccd3009aa5307dc09037d26d7f28 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:13:24,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:13:24,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:13:24,617 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:13:24,619 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:13:24,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:13:24,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:13:24,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:13:24,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:13:24,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:13:24,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:13:24,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:13:24,638 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:13:24,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:13:24,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:13:24,638 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:13:24,638 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:13:24,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:13:24,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:13:24,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:13:24,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:13:24,640 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:13:24,641 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:13:24,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:13:24,642 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:13:24,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:13:24,642 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:13:24,642 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:13:24,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:13:24,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:13:24,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:13:24,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:13:24,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:13:24,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:13:24,643 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:13:24,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:13:24,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:13:24,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:13:24,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:13:24,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:13:24,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:13:24,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:13:24,644 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/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 -> aee5edffc06a346ddce4a9cfa75b4213bee8ccd3009aa5307dc09037d26d7f28 [2025-03-17 11:13:24,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:13:24,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:13:24,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:13:24,902 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:13:24,902 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:13:24,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c [2025-03-17 11:13:26,084 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf175ced/66de12f2d1c6485e9649689ea173d25e/FLAG54e6ca4ba [2025-03-17 11:13:26,309 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:13:26,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-2.wvr.c [2025-03-17 11:13:26,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf175ced/66de12f2d1c6485e9649689ea173d25e/FLAG54e6ca4ba [2025-03-17 11:13:26,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbf175ced/66de12f2d1c6485e9649689ea173d25e [2025-03-17 11:13:26,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:13:26,371 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:13:26,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:13:26,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:13:26,377 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:13:26,378 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:26" (1/1) ... [2025-03-17 11:13:26,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19211522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:26, skipping insertion in model container [2025-03-17 11:13:26,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:26" (1/1) ... [2025-03-17 11:13:26,396 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:13:26,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:13:26,565 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:13:26,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:13:26,625 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:13:26,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:26 WrapperNode [2025-03-17 11:13:26,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:13:26,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:13:26,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:13:26,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:13:26,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:26" (1/1) ... [2025-03-17 11:13:26,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:26" (1/1) ... [2025-03-17 11:13:26,684 INFO L138 Inliner]: procedures = 28, calls = 59, calls flagged for inlining = 23, calls inlined = 33, statements flattened = 629 [2025-03-17 11:13:26,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:13:26,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:13:26,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:13:26,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:13:26,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:26" (1/1) ... [2025-03-17 11:13:26,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:26" (1/1) ... [2025-03-17 11:13:26,698 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:26" (1/1) ... [2025-03-17 11:13:26,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:26" (1/1) ... [2025-03-17 11:13:26,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:26" (1/1) ... [2025-03-17 11:13:26,718 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:26" (1/1) ... [2025-03-17 11:13:26,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:26" (1/1) ... [2025-03-17 11:13:26,721 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:26" (1/1) ... [2025-03-17 11:13:26,727 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:13:26,728 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:13:26,728 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:13:26,728 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:13:26,729 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:26" (1/1) ... [2025-03-17 11:13:26,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:13:26,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:13:26,759 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:13:26,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:13:26,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:13:26,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:13:26,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:13:26,780 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:13:26,780 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:13:26,780 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:13:26,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:13:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-17 11:13:26,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-17 11:13:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-17 11:13:26,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-17 11:13:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:13:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-17 11:13:26,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-17 11:13:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-17 11:13:26,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-17 11:13:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 11:13:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 11:13:26,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:13:26,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:13:26,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:13:26,783 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:13:26,887 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:13:26,888 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:13:27,526 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:13:27,526 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:13:27,834 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:13:27,834 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:13:27,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:27 BoogieIcfgContainer [2025-03-17 11:13:27,835 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:13:27,836 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:13:27,836 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:13:27,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:13:27,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:13:26" (1/3) ... [2025-03-17 11:13:27,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194223a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:27, skipping insertion in model container [2025-03-17 11:13:27,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:26" (2/3) ... [2025-03-17 11:13:27,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194223a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:27, skipping insertion in model container [2025-03-17 11:13:27,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:27" (3/3) ... [2025-03-17 11:13:27,843 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2025-03-17 11:13:27,856 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:13:27,858 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-2.wvr.c that has 7 procedures, 453 locations, 1 initial locations, 5 loop locations, and 83 error locations. [2025-03-17 11:13:27,859 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:13:27,959 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-03-17 11:13:27,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 513 places, 521 transitions, 1108 flow [2025-03-17 11:13:28,101 INFO L124 PetriNetUnfolderBase]: 25/471 cut-off events. [2025-03-17 11:13:28,103 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-17 11:13:28,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 471 events. 25/471 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 834 event pairs, 0 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 413. Up to 3 conditions per place. [2025-03-17 11:13:28,111 INFO L82 GeneralOperation]: Start removeDead. Operand has 513 places, 521 transitions, 1108 flow [2025-03-17 11:13:28,121 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 449 places, 454 transitions, 956 flow [2025-03-17 11:13:28,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:13:28,138 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;@b3d21db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:13:28,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2025-03-17 11:13:28,146 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:13:28,146 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-03-17 11:13:28,147 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:13:28,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:28,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:28,148 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:28,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:28,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1905814353, now seen corresponding path program 1 times [2025-03-17 11:13:28,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:28,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821167350] [2025-03-17 11:13:28,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:28,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:28,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 11:13:28,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 11:13:28,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:28,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:28,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:28,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:28,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821167350] [2025-03-17 11:13:28,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821167350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:28,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:28,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:28,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812687837] [2025-03-17 11:13:28,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:28,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:28,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:28,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:28,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:28,369 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-03-17 11:13:28,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 454 transitions, 956 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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-03-17 11:13:28,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:28,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-03-17 11:13:28,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:29,156 INFO L124 PetriNetUnfolderBase]: 1371/4047 cut-off events. [2025-03-17 11:13:29,157 INFO L125 PetriNetUnfolderBase]: For 1093/1093 co-relation queries the response was YES. [2025-03-17 11:13:29,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6725 conditions, 4047 events. 1371/4047 cut-off events. For 1093/1093 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 29984 event pairs, 599 based on Foata normal form. 619/3928 useless extension candidates. Maximal degree in co-relation 6252. Up to 1734 conditions per place. [2025-03-17 11:13:29,192 INFO L140 encePairwiseOnDemand]: 462/525 looper letters, 31 selfloop transitions, 2 changer transitions 4/393 dead transitions. [2025-03-17 11:13:29,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 393 transitions, 900 flow [2025-03-17 11:13:29,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1321 transitions. [2025-03-17 11:13:29,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8387301587301588 [2025-03-17 11:13:29,207 INFO L175 Difference]: Start difference. First operand has 449 places, 454 transitions, 956 flow. Second operand 3 states and 1321 transitions. [2025-03-17 11:13:29,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 393 transitions, 900 flow [2025-03-17 11:13:29,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 393 transitions, 868 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-03-17 11:13:29,225 INFO L231 Difference]: Finished difference. Result has 388 places, 389 transitions, 798 flow [2025-03-17 11:13:29,228 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=802, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=388, PETRI_TRANSITIONS=389} [2025-03-17 11:13:29,232 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -61 predicate places. [2025-03-17 11:13:29,232 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 389 transitions, 798 flow [2025-03-17 11:13:29,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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-03-17 11:13:29,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:29,233 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] [2025-03-17 11:13:29,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:13:29,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:29,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:29,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1294624728, now seen corresponding path program 1 times [2025-03-17 11:13:29,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:29,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111213896] [2025-03-17 11:13:29,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:29,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:29,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-17 11:13:29,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-17 11:13:29,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:29,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:29,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:29,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:29,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111213896] [2025-03-17 11:13:29,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111213896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:29,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:29,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:29,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276173911] [2025-03-17 11:13:29,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:29,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:29,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:29,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:29,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:29,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-03-17 11:13:29,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 389 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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-03-17 11:13:29,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:29,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-03-17 11:13:29,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:29,780 INFO L124 PetriNetUnfolderBase]: 1365/3943 cut-off events. [2025-03-17 11:13:29,780 INFO L125 PetriNetUnfolderBase]: For 305/305 co-relation queries the response was YES. [2025-03-17 11:13:29,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5833 conditions, 3943 events. 1365/3943 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 28822 event pairs, 594 based on Foata normal form. 0/3237 useless extension candidates. Maximal degree in co-relation 5795. Up to 1726 conditions per place. [2025-03-17 11:13:29,805 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 31 selfloop transitions, 2 changer transitions 0/388 dead transitions. [2025-03-17 11:13:29,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 388 transitions, 862 flow [2025-03-17 11:13:29,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1261 transitions. [2025-03-17 11:13:29,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8006349206349206 [2025-03-17 11:13:29,808 INFO L175 Difference]: Start difference. First operand has 388 places, 389 transitions, 798 flow. Second operand 3 states and 1261 transitions. [2025-03-17 11:13:29,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 388 transitions, 862 flow [2025-03-17 11:13:29,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 388 transitions, 858 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:29,813 INFO L231 Difference]: Finished difference. Result has 383 places, 388 transitions, 796 flow [2025-03-17 11:13:29,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=383, PETRI_TRANSITIONS=388} [2025-03-17 11:13:29,814 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -66 predicate places. [2025-03-17 11:13:29,814 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 388 transitions, 796 flow [2025-03-17 11:13:29,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 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-03-17 11:13:29,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:29,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:29,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:13:29,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:29,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:29,816 INFO L85 PathProgramCache]: Analyzing trace with hash -306802423, now seen corresponding path program 1 times [2025-03-17 11:13:29,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:29,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940551933] [2025-03-17 11:13:29,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:29,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:29,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 11:13:29,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 11:13:29,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:29,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:29,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:29,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:29,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940551933] [2025-03-17 11:13:29,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940551933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:29,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:29,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:29,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387252032] [2025-03-17 11:13:29,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:29,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:29,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:29,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:29,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:29,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-03-17 11:13:29,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 388 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-03-17 11:13:29,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:29,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-03-17 11:13:29,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:30,451 INFO L124 PetriNetUnfolderBase]: 1319/3801 cut-off events. [2025-03-17 11:13:30,451 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-03-17 11:13:30,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5621 conditions, 3801 events. 1319/3801 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 27282 event pairs, 568 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 5575. Up to 1660 conditions per place. [2025-03-17 11:13:30,479 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2025-03-17 11:13:30,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 387 transitions, 856 flow [2025-03-17 11:13:30,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-03-17 11:13:30,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-03-17 11:13:30,483 INFO L175 Difference]: Start difference. First operand has 383 places, 388 transitions, 796 flow. Second operand 3 states and 1268 transitions. [2025-03-17 11:13:30,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 387 transitions, 856 flow [2025-03-17 11:13:30,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 387 transitions, 852 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:30,489 INFO L231 Difference]: Finished difference. Result has 382 places, 387 transitions, 794 flow [2025-03-17 11:13:30,489 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=382, PETRI_TRANSITIONS=387} [2025-03-17 11:13:30,490 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -67 predicate places. [2025-03-17 11:13:30,490 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 387 transitions, 794 flow [2025-03-17 11:13:30,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-03-17 11:13:30,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:30,491 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:30,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:13:30,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:30,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:30,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1153388514, now seen corresponding path program 1 times [2025-03-17 11:13:30,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:30,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595923649] [2025-03-17 11:13:30,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:30,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:30,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 11:13:30,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 11:13:30,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:30,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:30,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:30,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595923649] [2025-03-17 11:13:30,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595923649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:30,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:30,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:30,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659921317] [2025-03-17 11:13:30,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:30,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:30,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:30,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:30,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:30,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-03-17 11:13:30,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 387 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-03-17 11:13:30,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:30,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-03-17 11:13:30,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:30,948 INFO L124 PetriNetUnfolderBase]: 1319/3800 cut-off events. [2025-03-17 11:13:30,949 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-03-17 11:13:30,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5620 conditions, 3800 events. 1319/3800 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 27366 event pairs, 568 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 5566. Up to 1660 conditions per place. [2025-03-17 11:13:30,969 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2025-03-17 11:13:30,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 386 transitions, 854 flow [2025-03-17 11:13:30,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:30,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:30,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-03-17 11:13:30,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-03-17 11:13:30,972 INFO L175 Difference]: Start difference. First operand has 382 places, 387 transitions, 794 flow. Second operand 3 states and 1268 transitions. [2025-03-17 11:13:30,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 386 transitions, 854 flow [2025-03-17 11:13:30,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 386 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:30,976 INFO L231 Difference]: Finished difference. Result has 381 places, 386 transitions, 792 flow [2025-03-17 11:13:30,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=381, PETRI_TRANSITIONS=386} [2025-03-17 11:13:30,977 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -68 predicate places. [2025-03-17 11:13:30,977 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 386 transitions, 792 flow [2025-03-17 11:13:30,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-03-17 11:13:30,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:30,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:30,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:13:30,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:30,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:30,979 INFO L85 PathProgramCache]: Analyzing trace with hash 205998328, now seen corresponding path program 1 times [2025-03-17 11:13:30,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:30,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326800387] [2025-03-17 11:13:30,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:30,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:30,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-17 11:13:30,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-17 11:13:30,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:30,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:31,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:31,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326800387] [2025-03-17 11:13:31,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326800387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:31,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:31,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:31,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730163977] [2025-03-17 11:13:31,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:31,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:31,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:31,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:31,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:31,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-03-17 11:13:31,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 386 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-03-17 11:13:31,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:31,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-03-17 11:13:31,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:31,407 INFO L124 PetriNetUnfolderBase]: 1319/3799 cut-off events. [2025-03-17 11:13:31,407 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-03-17 11:13:31,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5619 conditions, 3799 events. 1319/3799 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 27346 event pairs, 568 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 5557. Up to 1660 conditions per place. [2025-03-17 11:13:31,431 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2025-03-17 11:13:31,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 385 transitions, 852 flow [2025-03-17 11:13:31,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:31,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-03-17 11:13:31,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-03-17 11:13:31,435 INFO L175 Difference]: Start difference. First operand has 381 places, 386 transitions, 792 flow. Second operand 3 states and 1268 transitions. [2025-03-17 11:13:31,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 385 transitions, 852 flow [2025-03-17 11:13:31,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 385 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:31,441 INFO L231 Difference]: Finished difference. Result has 380 places, 385 transitions, 790 flow [2025-03-17 11:13:31,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=790, PETRI_PLACES=380, PETRI_TRANSITIONS=385} [2025-03-17 11:13:31,445 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -69 predicate places. [2025-03-17 11:13:31,445 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 385 transitions, 790 flow [2025-03-17 11:13:31,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-03-17 11:13:31,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:31,446 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] [2025-03-17 11:13:31,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:13:31,446 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:31,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2035669828, now seen corresponding path program 1 times [2025-03-17 11:13:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:31,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475556770] [2025-03-17 11:13:31,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:31,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:31,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-17 11:13:31,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-17 11:13:31,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:31,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:31,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:31,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475556770] [2025-03-17 11:13:31,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475556770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:31,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:31,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:31,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542128414] [2025-03-17 11:13:31,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:31,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:31,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:31,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:31,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:31,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-03-17 11:13:31,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 385 transitions, 790 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-03-17 11:13:31,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:31,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-03-17 11:13:31,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:31,888 INFO L124 PetriNetUnfolderBase]: 1319/3798 cut-off events. [2025-03-17 11:13:31,889 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-03-17 11:13:31,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5618 conditions, 3798 events. 1319/3798 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 27346 event pairs, 568 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 5548. Up to 1660 conditions per place. [2025-03-17 11:13:31,911 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2025-03-17 11:13:31,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 384 transitions, 850 flow [2025-03-17 11:13:31,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:31,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-03-17 11:13:31,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-03-17 11:13:31,914 INFO L175 Difference]: Start difference. First operand has 380 places, 385 transitions, 790 flow. Second operand 3 states and 1268 transitions. [2025-03-17 11:13:31,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 384 transitions, 850 flow [2025-03-17 11:13:31,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 384 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:31,917 INFO L231 Difference]: Finished difference. Result has 379 places, 384 transitions, 788 flow [2025-03-17 11:13:31,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=788, PETRI_PLACES=379, PETRI_TRANSITIONS=384} [2025-03-17 11:13:31,918 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -70 predicate places. [2025-03-17 11:13:31,918 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 384 transitions, 788 flow [2025-03-17 11:13:31,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-03-17 11:13:31,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:31,919 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] [2025-03-17 11:13:31,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:13:31,920 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:31,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:31,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1903504769, now seen corresponding path program 1 times [2025-03-17 11:13:31,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:31,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875116681] [2025-03-17 11:13:31,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:31,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:31,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 11:13:31,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 11:13:31,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:31,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:31,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:31,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875116681] [2025-03-17 11:13:31,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875116681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:31,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:31,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:31,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646846165] [2025-03-17 11:13:31,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:31,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:31,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:31,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:31,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:31,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 525 [2025-03-17 11:13:31,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 384 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 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-03-17 11:13:31,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:31,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 525 [2025-03-17 11:13:31,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:32,393 INFO L124 PetriNetUnfolderBase]: 1319/3797 cut-off events. [2025-03-17 11:13:32,394 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-03-17 11:13:32,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5623 conditions, 3797 events. 1319/3797 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 27328 event pairs, 568 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 5545. Up to 1666 conditions per place. [2025-03-17 11:13:32,414 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 35 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2025-03-17 11:13:32,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 383 transitions, 860 flow [2025-03-17 11:13:32,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:32,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1256 transitions. [2025-03-17 11:13:32,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7974603174603174 [2025-03-17 11:13:32,418 INFO L175 Difference]: Start difference. First operand has 379 places, 384 transitions, 788 flow. Second operand 3 states and 1256 transitions. [2025-03-17 11:13:32,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 383 transitions, 860 flow [2025-03-17 11:13:32,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 383 transitions, 856 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:32,423 INFO L231 Difference]: Finished difference. Result has 378 places, 383 transitions, 786 flow [2025-03-17 11:13:32,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=786, PETRI_PLACES=378, PETRI_TRANSITIONS=383} [2025-03-17 11:13:32,424 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -71 predicate places. [2025-03-17 11:13:32,424 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 383 transitions, 786 flow [2025-03-17 11:13:32,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 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-03-17 11:13:32,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:32,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:32,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:13:32,425 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:32,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:32,425 INFO L85 PathProgramCache]: Analyzing trace with hash 2104520951, now seen corresponding path program 1 times [2025-03-17 11:13:32,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:32,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968382473] [2025-03-17 11:13:32,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:32,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:32,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-17 11:13:32,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-17 11:13:32,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:32,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:32,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:32,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968382473] [2025-03-17 11:13:32,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968382473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:32,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:32,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:32,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446256412] [2025-03-17 11:13:32,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:32,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:32,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:32,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:32,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:32,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 525 [2025-03-17 11:13:32,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 383 transitions, 786 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 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-03-17 11:13:32,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:32,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 525 [2025-03-17 11:13:32,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:32,929 INFO L124 PetriNetUnfolderBase]: 1319/3796 cut-off events. [2025-03-17 11:13:32,930 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-03-17 11:13:32,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5617 conditions, 3796 events. 1319/3796 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 27259 event pairs, 568 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 5531. Up to 1661 conditions per place. [2025-03-17 11:13:32,951 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 30 selfloop transitions, 2 changer transitions 0/382 dead transitions. [2025-03-17 11:13:32,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 382 transitions, 848 flow [2025-03-17 11:13:32,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:32,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-03-17 11:13:32,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038095238095239 [2025-03-17 11:13:32,954 INFO L175 Difference]: Start difference. First operand has 378 places, 383 transitions, 786 flow. Second operand 3 states and 1266 transitions. [2025-03-17 11:13:32,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 382 transitions, 848 flow [2025-03-17 11:13:32,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 382 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:32,958 INFO L231 Difference]: Finished difference. Result has 377 places, 382 transitions, 784 flow [2025-03-17 11:13:32,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=784, PETRI_PLACES=377, PETRI_TRANSITIONS=382} [2025-03-17 11:13:32,959 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -72 predicate places. [2025-03-17 11:13:32,959 INFO L471 AbstractCegarLoop]: Abstraction has has 377 places, 382 transitions, 784 flow [2025-03-17 11:13:32,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 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-03-17 11:13:32,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:32,960 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] [2025-03-17 11:13:32,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:13:32,961 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:32,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:32,961 INFO L85 PathProgramCache]: Analyzing trace with hash -913722334, now seen corresponding path program 1 times [2025-03-17 11:13:32,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:32,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888631471] [2025-03-17 11:13:32,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:32,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:32,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 11:13:32,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 11:13:32,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:32,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:33,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:33,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:33,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888631471] [2025-03-17 11:13:33,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888631471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:33,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:33,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:33,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748060747] [2025-03-17 11:13:33,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:33,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:33,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:33,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:33,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:33,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 525 [2025-03-17 11:13:33,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 382 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 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-03-17 11:13:33,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:33,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 525 [2025-03-17 11:13:33,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:33,337 INFO L124 PetriNetUnfolderBase]: 1319/3795 cut-off events. [2025-03-17 11:13:33,337 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-03-17 11:13:33,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5616 conditions, 3795 events. 1319/3795 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 27254 event pairs, 568 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 5522. Up to 1661 conditions per place. [2025-03-17 11:13:33,355 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 30 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2025-03-17 11:13:33,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 381 transitions, 846 flow [2025-03-17 11:13:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-03-17 11:13:33,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038095238095239 [2025-03-17 11:13:33,358 INFO L175 Difference]: Start difference. First operand has 377 places, 382 transitions, 784 flow. Second operand 3 states and 1266 transitions. [2025-03-17 11:13:33,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 381 transitions, 846 flow [2025-03-17 11:13:33,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 381 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:33,362 INFO L231 Difference]: Finished difference. Result has 376 places, 381 transitions, 782 flow [2025-03-17 11:13:33,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=376, PETRI_TRANSITIONS=381} [2025-03-17 11:13:33,363 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -73 predicate places. [2025-03-17 11:13:33,363 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 381 transitions, 782 flow [2025-03-17 11:13:33,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 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-03-17 11:13:33,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:33,363 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] [2025-03-17 11:13:33,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:13:33,364 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:33,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash 967165331, now seen corresponding path program 1 times [2025-03-17 11:13:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:33,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978765827] [2025-03-17 11:13:33,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:33,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:33,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 11:13:33,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 11:13:33,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:33,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:33,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:33,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978765827] [2025-03-17 11:13:33,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978765827] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:33,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:33,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:33,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015304855] [2025-03-17 11:13:33,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:33,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:33,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:33,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:33,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:33,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 525 [2025-03-17 11:13:33,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 381 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 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-03-17 11:13:33,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:33,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 525 [2025-03-17 11:13:33,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:33,729 INFO L124 PetriNetUnfolderBase]: 1319/3794 cut-off events. [2025-03-17 11:13:33,729 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-03-17 11:13:33,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5615 conditions, 3794 events. 1319/3794 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 27254 event pairs, 568 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 5513. Up to 1661 conditions per place. [2025-03-17 11:13:33,750 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 30 selfloop transitions, 2 changer transitions 0/380 dead transitions. [2025-03-17 11:13:33,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 380 transitions, 844 flow [2025-03-17 11:13:33,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:33,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-03-17 11:13:33,752 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038095238095239 [2025-03-17 11:13:33,753 INFO L175 Difference]: Start difference. First operand has 376 places, 381 transitions, 782 flow. Second operand 3 states and 1266 transitions. [2025-03-17 11:13:33,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 380 transitions, 844 flow [2025-03-17 11:13:33,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 380 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:33,757 INFO L231 Difference]: Finished difference. Result has 375 places, 380 transitions, 780 flow [2025-03-17 11:13:33,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=375, PETRI_TRANSITIONS=380} [2025-03-17 11:13:33,758 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -74 predicate places. [2025-03-17 11:13:33,758 INFO L471 AbstractCegarLoop]: Abstraction has has 375 places, 380 transitions, 780 flow [2025-03-17 11:13:33,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 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-03-17 11:13:33,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:33,759 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] [2025-03-17 11:13:33,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:13:33,759 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:33,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:33,760 INFO L85 PathProgramCache]: Analyzing trace with hash -618951943, now seen corresponding path program 1 times [2025-03-17 11:13:33,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:33,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329577176] [2025-03-17 11:13:33,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:33,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:33,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 11:13:33,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 11:13:33,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:33,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:33,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:33,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329577176] [2025-03-17 11:13:33,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329577176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:33,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:33,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:33,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053482973] [2025-03-17 11:13:33,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:33,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:33,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:33,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:33,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:33,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 525 [2025-03-17 11:13:33,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 380 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 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-03-17 11:13:33,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:33,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 525 [2025-03-17 11:13:33,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:34,113 INFO L124 PetriNetUnfolderBase]: 1319/3793 cut-off events. [2025-03-17 11:13:34,113 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-03-17 11:13:34,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5614 conditions, 3793 events. 1319/3793 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 27317 event pairs, 568 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 5504. Up to 1661 conditions per place. [2025-03-17 11:13:34,133 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 30 selfloop transitions, 2 changer transitions 0/379 dead transitions. [2025-03-17 11:13:34,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 379 transitions, 842 flow [2025-03-17 11:13:34,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1266 transitions. [2025-03-17 11:13:34,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8038095238095239 [2025-03-17 11:13:34,135 INFO L175 Difference]: Start difference. First operand has 375 places, 380 transitions, 780 flow. Second operand 3 states and 1266 transitions. [2025-03-17 11:13:34,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 379 transitions, 842 flow [2025-03-17 11:13:34,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 379 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:34,139 INFO L231 Difference]: Finished difference. Result has 374 places, 379 transitions, 778 flow [2025-03-17 11:13:34,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=374, PETRI_TRANSITIONS=379} [2025-03-17 11:13:34,140 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -75 predicate places. [2025-03-17 11:13:34,140 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 379 transitions, 778 flow [2025-03-17 11:13:34,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 412.3333333333333) internal successors, (1237), 3 states have internal predecessors, (1237), 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-03-17 11:13:34,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:34,141 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] [2025-03-17 11:13:34,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:13:34,141 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:34,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:34,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1359335969, now seen corresponding path program 1 times [2025-03-17 11:13:34,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:34,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800942936] [2025-03-17 11:13:34,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:34,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:34,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-17 11:13:34,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-17 11:13:34,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:34,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:34,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:34,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800942936] [2025-03-17 11:13:34,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800942936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:34,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:34,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:34,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911418728] [2025-03-17 11:13:34,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:34,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:34,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:34,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:34,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:34,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 525 [2025-03-17 11:13:34,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 379 transitions, 778 flow. Second operand has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 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-03-17 11:13:34,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:34,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 525 [2025-03-17 11:13:34,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:34,548 INFO L124 PetriNetUnfolderBase]: 1406/4050 cut-off events. [2025-03-17 11:13:34,548 INFO L125 PetriNetUnfolderBase]: For 311/311 co-relation queries the response was YES. [2025-03-17 11:13:34,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6004 conditions, 4050 events. 1406/4050 cut-off events. For 311/311 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 29783 event pairs, 616 based on Foata normal form. 0/3350 useless extension candidates. Maximal degree in co-relation 5886. Up to 1786 conditions per place. [2025-03-17 11:13:34,561 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 33 selfloop transitions, 2 changer transitions 0/378 dead transitions. [2025-03-17 11:13:34,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 378 transitions, 846 flow [2025-03-17 11:13:34,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:34,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1254 transitions. [2025-03-17 11:13:34,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7961904761904762 [2025-03-17 11:13:34,563 INFO L175 Difference]: Start difference. First operand has 374 places, 379 transitions, 778 flow. Second operand 3 states and 1254 transitions. [2025-03-17 11:13:34,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 378 transitions, 846 flow [2025-03-17 11:13:34,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 378 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:34,566 INFO L231 Difference]: Finished difference. Result has 373 places, 378 transitions, 776 flow [2025-03-17 11:13:34,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=376, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=776, PETRI_PLACES=373, PETRI_TRANSITIONS=378} [2025-03-17 11:13:34,567 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -76 predicate places. [2025-03-17 11:13:34,567 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 378 transitions, 776 flow [2025-03-17 11:13:34,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.3333333333333) internal successors, (1222), 3 states have internal predecessors, (1222), 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-03-17 11:13:34,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:34,568 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] [2025-03-17 11:13:34,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:13:34,568 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:34,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:34,568 INFO L85 PathProgramCache]: Analyzing trace with hash -635173504, now seen corresponding path program 1 times [2025-03-17 11:13:34,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:34,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520687812] [2025-03-17 11:13:34,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:34,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:34,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-17 11:13:34,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-17 11:13:34,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:34,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:34,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:34,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:34,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520687812] [2025-03-17 11:13:34,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520687812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:34,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:34,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:34,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494455260] [2025-03-17 11:13:34,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:34,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:34,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:34,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:34,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:34,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 525 [2025-03-17 11:13:34,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 378 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 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-03-17 11:13:34,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:34,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 525 [2025-03-17 11:13:34,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:34,991 INFO L124 PetriNetUnfolderBase]: 1507/4324 cut-off events. [2025-03-17 11:13:34,991 INFO L125 PetriNetUnfolderBase]: For 334/334 co-relation queries the response was YES. [2025-03-17 11:13:35,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6430 conditions, 4324 events. 1507/4324 cut-off events. For 334/334 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 32508 event pairs, 676 based on Foata normal form. 0/3589 useless extension candidates. Maximal degree in co-relation 6304. Up to 1928 conditions per place. [2025-03-17 11:13:35,015 INFO L140 encePairwiseOnDemand]: 520/525 looper letters, 34 selfloop transitions, 1 changer transitions 0/374 dead transitions. [2025-03-17 11:13:35,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 374 transitions, 838 flow [2025-03-17 11:13:35,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:35,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2025-03-17 11:13:35,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7866666666666666 [2025-03-17 11:13:35,017 INFO L175 Difference]: Start difference. First operand has 373 places, 378 transitions, 776 flow. Second operand 3 states and 1239 transitions. [2025-03-17 11:13:35,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 374 transitions, 838 flow [2025-03-17 11:13:35,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 374 transitions, 834 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:35,024 INFO L231 Difference]: Finished difference. Result has 369 places, 374 transitions, 766 flow [2025-03-17 11:13:35,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=766, PETRI_PLACES=369, PETRI_TRANSITIONS=374} [2025-03-17 11:13:35,026 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -80 predicate places. [2025-03-17 11:13:35,026 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 374 transitions, 766 flow [2025-03-17 11:13:35,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 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-03-17 11:13:35,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:35,027 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] [2025-03-17 11:13:35,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:13:35,027 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:35,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:35,027 INFO L85 PathProgramCache]: Analyzing trace with hash 2084986665, now seen corresponding path program 1 times [2025-03-17 11:13:35,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:35,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248904282] [2025-03-17 11:13:35,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:35,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:35,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 11:13:35,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 11:13:35,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:35,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:35,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:35,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248904282] [2025-03-17 11:13:35,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248904282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:35,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:35,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:35,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781252506] [2025-03-17 11:13:35,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:35,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:35,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:35,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:35,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:35,082 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 412 out of 525 [2025-03-17 11:13:35,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 374 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-03-17 11:13:35,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:35,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 412 of 525 [2025-03-17 11:13:35,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:35,602 INFO L124 PetriNetUnfolderBase]: 1319/3780 cut-off events. [2025-03-17 11:13:35,603 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-03-17 11:13:35,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5599 conditions, 3780 events. 1319/3780 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 27186 event pairs, 568 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 5473. Up to 1660 conditions per place. [2025-03-17 11:13:35,628 INFO L140 encePairwiseOnDemand]: 522/525 looper letters, 29 selfloop transitions, 2 changer transitions 0/373 dead transitions. [2025-03-17 11:13:35,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 373 transitions, 826 flow [2025-03-17 11:13:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:35,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:35,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2025-03-17 11:13:35,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8050793650793651 [2025-03-17 11:13:35,631 INFO L175 Difference]: Start difference. First operand has 369 places, 374 transitions, 766 flow. Second operand 3 states and 1268 transitions. [2025-03-17 11:13:35,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 373 transitions, 826 flow [2025-03-17 11:13:35,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 373 transitions, 825 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:35,637 INFO L231 Difference]: Finished difference. Result has 369 places, 373 transitions, 767 flow [2025-03-17 11:13:35,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=369, PETRI_TRANSITIONS=373} [2025-03-17 11:13:35,638 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -80 predicate places. [2025-03-17 11:13:35,638 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 373 transitions, 767 flow [2025-03-17 11:13:35,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 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-03-17 11:13:35,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:35,639 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] [2025-03-17 11:13:35,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:13:35,639 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:35,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:35,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1454906783, now seen corresponding path program 1 times [2025-03-17 11:13:35,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:35,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275787196] [2025-03-17 11:13:35,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:35,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:35,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-17 11:13:35,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-17 11:13:35,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:35,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:36,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:36,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275787196] [2025-03-17 11:13:36,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275787196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:36,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:36,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:13:36,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362739845] [2025-03-17 11:13:36,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:36,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:13:36,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:36,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:13:36,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:13:36,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 525 [2025-03-17 11:13:36,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 373 transitions, 767 flow. Second operand has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 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-03-17 11:13:36,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:36,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 525 [2025-03-17 11:13:36,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:36,621 INFO L124 PetriNetUnfolderBase]: 1319/3779 cut-off events. [2025-03-17 11:13:36,621 INFO L125 PetriNetUnfolderBase]: For 296/296 co-relation queries the response was YES. [2025-03-17 11:13:36,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5608 conditions, 3779 events. 1319/3779 cut-off events. For 296/296 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 27238 event pairs, 568 based on Foata normal form. 0/3128 useless extension candidates. Maximal degree in co-relation 5483. Up to 1665 conditions per place. [2025-03-17 11:13:36,643 INFO L140 encePairwiseOnDemand]: 519/525 looper letters, 34 selfloop transitions, 5 changer transitions 0/372 dead transitions. [2025-03-17 11:13:36,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 372 transitions, 843 flow [2025-03-17 11:13:36,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:13:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:13:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2470 transitions. [2025-03-17 11:13:36,647 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7841269841269841 [2025-03-17 11:13:36,647 INFO L175 Difference]: Start difference. First operand has 369 places, 373 transitions, 767 flow. Second operand 6 states and 2470 transitions. [2025-03-17 11:13:36,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 372 transitions, 843 flow [2025-03-17 11:13:36,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 372 transitions, 839 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:36,651 INFO L231 Difference]: Finished difference. Result has 371 places, 372 transitions, 771 flow [2025-03-17 11:13:36,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=771, PETRI_PLACES=371, PETRI_TRANSITIONS=372} [2025-03-17 11:13:36,653 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -78 predicate places. [2025-03-17 11:13:36,653 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 372 transitions, 771 flow [2025-03-17 11:13:36,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 406.5) internal successors, (2439), 6 states have internal predecessors, (2439), 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-03-17 11:13:36,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:36,654 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] [2025-03-17 11:13:36,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:13:36,654 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:36,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:36,655 INFO L85 PathProgramCache]: Analyzing trace with hash 684858562, now seen corresponding path program 1 times [2025-03-17 11:13:36,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:36,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65155387] [2025-03-17 11:13:36,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:36,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:36,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-17 11:13:36,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-17 11:13:36,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:36,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:36,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:36,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65155387] [2025-03-17 11:13:36,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65155387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:36,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:36,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:36,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689081837] [2025-03-17 11:13:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:36,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:36,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:36,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:36,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:36,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 525 [2025-03-17 11:13:36,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 372 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 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-03-17 11:13:36,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:36,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 525 [2025-03-17 11:13:36,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:37,208 INFO L124 PetriNetUnfolderBase]: 1841/4780 cut-off events. [2025-03-17 11:13:37,208 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2025-03-17 11:13:37,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7348 conditions, 4780 events. 1841/4780 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 35791 event pairs, 413 based on Foata normal form. 0/4007 useless extension candidates. Maximal degree in co-relation 7330. Up to 1179 conditions per place. [2025-03-17 11:13:37,243 INFO L140 encePairwiseOnDemand]: 516/525 looper letters, 58 selfloop transitions, 3 changer transitions 0/388 dead transitions. [2025-03-17 11:13:37,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 388 transitions, 937 flow [2025-03-17 11:13:37,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:37,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1267 transitions. [2025-03-17 11:13:37,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8044444444444444 [2025-03-17 11:13:37,245 INFO L175 Difference]: Start difference. First operand has 371 places, 372 transitions, 771 flow. Second operand 3 states and 1267 transitions. [2025-03-17 11:13:37,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 388 transitions, 937 flow [2025-03-17 11:13:37,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 388 transitions, 927 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:13:37,252 INFO L231 Difference]: Finished difference. Result has 364 places, 368 transitions, 769 flow [2025-03-17 11:13:37,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=749, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=364, PETRI_TRANSITIONS=368} [2025-03-17 11:13:37,252 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -85 predicate places. [2025-03-17 11:13:37,253 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 368 transitions, 769 flow [2025-03-17 11:13:37,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.0) internal successors, (1203), 3 states have internal predecessors, (1203), 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-03-17 11:13:37,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:37,254 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] [2025-03-17 11:13:37,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:13:37,254 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:37,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:37,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1019134750, now seen corresponding path program 1 times [2025-03-17 11:13:37,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:37,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721277684] [2025-03-17 11:13:37,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:37,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:37,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-17 11:13:37,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-17 11:13:37,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:37,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:37,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:37,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:37,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721277684] [2025-03-17 11:13:37,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721277684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:37,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:37,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:37,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190062256] [2025-03-17 11:13:37,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:37,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:37,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:37,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:37,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:37,297 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 525 [2025-03-17 11:13:37,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 368 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 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-03-17 11:13:37,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:37,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 525 [2025-03-17 11:13:37,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:37,933 INFO L124 PetriNetUnfolderBase]: 2365/6440 cut-off events. [2025-03-17 11:13:37,934 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2025-03-17 11:13:37,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10107 conditions, 6440 events. 2365/6440 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 53636 event pairs, 629 based on Foata normal form. 0/5414 useless extension candidates. Maximal degree in co-relation 9980. Up to 1646 conditions per place. [2025-03-17 11:13:37,963 INFO L140 encePairwiseOnDemand]: 521/525 looper letters, 50 selfloop transitions, 4 changer transitions 0/390 dead transitions. [2025-03-17 11:13:37,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 390 transitions, 944 flow [2025-03-17 11:13:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:37,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1296 transitions. [2025-03-17 11:13:37,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8228571428571428 [2025-03-17 11:13:37,968 INFO L175 Difference]: Start difference. First operand has 364 places, 368 transitions, 769 flow. Second operand 3 states and 1296 transitions. [2025-03-17 11:13:37,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 390 transitions, 944 flow [2025-03-17 11:13:37,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 390 transitions, 934 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:37,972 INFO L231 Difference]: Finished difference. Result has 365 places, 370 transitions, 793 flow [2025-03-17 11:13:37,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=365, PETRI_TRANSITIONS=370} [2025-03-17 11:13:37,973 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -84 predicate places. [2025-03-17 11:13:37,973 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 370 transitions, 793 flow [2025-03-17 11:13:37,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 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-03-17 11:13:37,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:37,974 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] [2025-03-17 11:13:37,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:13:37,974 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:37,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:37,975 INFO L85 PathProgramCache]: Analyzing trace with hash -473275962, now seen corresponding path program 1 times [2025-03-17 11:13:37,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:37,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151506732] [2025-03-17 11:13:37,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:37,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-17 11:13:37,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-17 11:13:37,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:37,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:38,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:38,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151506732] [2025-03-17 11:13:38,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151506732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:38,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:38,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:38,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418557645] [2025-03-17 11:13:38,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:38,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:38,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:38,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:38,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:38,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 416 out of 525 [2025-03-17 11:13:38,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 370 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 416.6666666666667) internal successors, (1250), 3 states have internal predecessors, (1250), 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-03-17 11:13:38,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:38,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 416 of 525 [2025-03-17 11:13:38,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:39,069 INFO L124 PetriNetUnfolderBase]: 4048/10999 cut-off events. [2025-03-17 11:13:39,069 INFO L125 PetriNetUnfolderBase]: For 2311/2311 co-relation queries the response was YES. [2025-03-17 11:13:39,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17881 conditions, 10999 events. 4048/10999 cut-off events. For 2311/2311 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 104752 event pairs, 1964 based on Foata normal form. 0/9201 useless extension candidates. Maximal degree in co-relation 17754. Up to 3035 conditions per place. [2025-03-17 11:13:39,135 INFO L140 encePairwiseOnDemand]: 521/525 looper letters, 60 selfloop transitions, 3 changer transitions 0/399 dead transitions. [2025-03-17 11:13:39,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 399 transitions, 1022 flow [2025-03-17 11:13:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:39,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:39,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1302 transitions. [2025-03-17 11:13:39,137 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2025-03-17 11:13:39,137 INFO L175 Difference]: Start difference. First operand has 365 places, 370 transitions, 793 flow. Second operand 3 states and 1302 transitions. [2025-03-17 11:13:39,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 399 transitions, 1022 flow [2025-03-17 11:13:39,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 399 transitions, 1008 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:39,147 INFO L231 Difference]: Finished difference. Result has 366 places, 371 transitions, 803 flow [2025-03-17 11:13:39,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=803, PETRI_PLACES=366, PETRI_TRANSITIONS=371} [2025-03-17 11:13:39,148 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -83 predicate places. [2025-03-17 11:13:39,148 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 371 transitions, 803 flow [2025-03-17 11:13:39,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.6666666666667) internal successors, (1250), 3 states have internal predecessors, (1250), 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-03-17 11:13:39,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:39,149 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] [2025-03-17 11:13:39,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:13:39,149 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:39,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:39,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1602920787, now seen corresponding path program 1 times [2025-03-17 11:13:39,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:39,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154812486] [2025-03-17 11:13:39,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:39,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:39,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-17 11:13:39,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-17 11:13:39,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:39,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:39,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:39,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154812486] [2025-03-17 11:13:39,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154812486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:39,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:39,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:39,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911697425] [2025-03-17 11:13:39,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:39,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:39,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:39,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:39,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:39,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 525 [2025-03-17 11:13:39,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 371 transitions, 803 flow. Second operand has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 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-03-17 11:13:39,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:39,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 525 [2025-03-17 11:13:39,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:41,232 INFO L124 PetriNetUnfolderBase]: 7061/18627 cut-off events. [2025-03-17 11:13:41,233 INFO L125 PetriNetUnfolderBase]: For 3915/3915 co-relation queries the response was YES. [2025-03-17 11:13:41,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31247 conditions, 18627 events. 7061/18627 cut-off events. For 3915/3915 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 193045 event pairs, 3451 based on Foata normal form. 0/15653 useless extension candidates. Maximal degree in co-relation 31118. Up to 5267 conditions per place. [2025-03-17 11:13:41,356 INFO L140 encePairwiseOnDemand]: 521/525 looper letters, 64 selfloop transitions, 4 changer transitions 0/402 dead transitions. [2025-03-17 11:13:41,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 402 transitions, 1052 flow [2025-03-17 11:13:41,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:41,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2025-03-17 11:13:41,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8253968253968254 [2025-03-17 11:13:41,358 INFO L175 Difference]: Start difference. First operand has 366 places, 371 transitions, 803 flow. Second operand 3 states and 1300 transitions. [2025-03-17 11:13:41,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 402 transitions, 1052 flow [2025-03-17 11:13:41,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 402 transitions, 1042 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:41,367 INFO L231 Difference]: Finished difference. Result has 367 places, 373 transitions, 827 flow [2025-03-17 11:13:41,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=827, PETRI_PLACES=367, PETRI_TRANSITIONS=373} [2025-03-17 11:13:41,368 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -82 predicate places. [2025-03-17 11:13:41,368 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 373 transitions, 827 flow [2025-03-17 11:13:41,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 416.0) internal successors, (1248), 3 states have internal predecessors, (1248), 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-03-17 11:13:41,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:41,368 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] [2025-03-17 11:13:41,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:13:41,369 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:41,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash 920483978, now seen corresponding path program 1 times [2025-03-17 11:13:41,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:41,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201222913] [2025-03-17 11:13:41,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:41,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:41,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 11:13:41,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 11:13:41,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:41,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:41,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201222913] [2025-03-17 11:13:41,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201222913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:41,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:41,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:41,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982575680] [2025-03-17 11:13:41,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:41,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:41,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:41,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:41,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:41,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-03-17 11:13:41,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 373 transitions, 827 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 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-03-17 11:13:41,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:41,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-03-17 11:13:41,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:43,735 INFO L124 PetriNetUnfolderBase]: 9127/21789 cut-off events. [2025-03-17 11:13:43,735 INFO L125 PetriNetUnfolderBase]: For 5562/5562 co-relation queries the response was YES. [2025-03-17 11:13:43,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38802 conditions, 21789 events. 9127/21789 cut-off events. For 5562/5562 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 218565 event pairs, 1204 based on Foata normal form. 0/18751 useless extension candidates. Maximal degree in co-relation 38672. Up to 10921 conditions per place. [2025-03-17 11:13:43,890 INFO L140 encePairwiseOnDemand]: 519/525 looper letters, 64 selfloop transitions, 4 changer transitions 0/398 dead transitions. [2025-03-17 11:13:43,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 398 transitions, 1057 flow [2025-03-17 11:13:43,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:43,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1282 transitions. [2025-03-17 11:13:43,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.813968253968254 [2025-03-17 11:13:43,893 INFO L175 Difference]: Start difference. First operand has 367 places, 373 transitions, 827 flow. Second operand 3 states and 1282 transitions. [2025-03-17 11:13:43,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 398 transitions, 1057 flow [2025-03-17 11:13:43,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 398 transitions, 1043 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:43,901 INFO L231 Difference]: Finished difference. Result has 366 places, 374 transitions, 839 flow [2025-03-17 11:13:43,902 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=815, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=839, PETRI_PLACES=366, PETRI_TRANSITIONS=374} [2025-03-17 11:13:43,902 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -83 predicate places. [2025-03-17 11:13:43,902 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 374 transitions, 839 flow [2025-03-17 11:13:43,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 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-03-17 11:13:43,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:43,903 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] [2025-03-17 11:13:43,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:13:43,903 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:43,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1239323462, now seen corresponding path program 1 times [2025-03-17 11:13:43,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:43,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632320426] [2025-03-17 11:13:43,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:43,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:43,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-17 11:13:43,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-17 11:13:43,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:43,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:43,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:43,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632320426] [2025-03-17 11:13:43,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632320426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:43,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:43,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:43,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566685807] [2025-03-17 11:13:43,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:43,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:43,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:43,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:43,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:43,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 525 [2025-03-17 11:13:43,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 374 transitions, 839 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 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-03-17 11:13:43,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:43,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 525 [2025-03-17 11:13:43,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:47,826 INFO L124 PetriNetUnfolderBase]: 11737/29775 cut-off events. [2025-03-17 11:13:47,826 INFO L125 PetriNetUnfolderBase]: For 7555/7555 co-relation queries the response was YES. [2025-03-17 11:13:47,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53798 conditions, 29775 events. 11737/29775 cut-off events. For 7555/7555 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 320286 event pairs, 2352 based on Foata normal form. 0/25692 useless extension candidates. Maximal degree in co-relation 53668. Up to 12037 conditions per place. [2025-03-17 11:13:48,032 INFO L140 encePairwiseOnDemand]: 519/525 looper letters, 69 selfloop transitions, 4 changer transitions 0/402 dead transitions. [2025-03-17 11:13:48,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 402 transitions, 1090 flow [2025-03-17 11:13:48,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1283 transitions. [2025-03-17 11:13:48,035 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8146031746031746 [2025-03-17 11:13:48,035 INFO L175 Difference]: Start difference. First operand has 366 places, 374 transitions, 839 flow. Second operand 3 states and 1283 transitions. [2025-03-17 11:13:48,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 402 transitions, 1090 flow [2025-03-17 11:13:48,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 402 transitions, 1090 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:13:48,042 INFO L231 Difference]: Finished difference. Result has 367 places, 375 transitions, 859 flow [2025-03-17 11:13:48,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=372, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=859, PETRI_PLACES=367, PETRI_TRANSITIONS=375} [2025-03-17 11:13:48,043 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -82 predicate places. [2025-03-17 11:13:48,043 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 375 transitions, 859 flow [2025-03-17 11:13:48,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 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-03-17 11:13:48,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:48,044 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 11:13:48,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:13:48,044 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:48,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:48,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1621713832, now seen corresponding path program 1 times [2025-03-17 11:13:48,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:48,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028954027] [2025-03-17 11:13:48,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:48,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:48,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-17 11:13:48,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-17 11:13:48,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:48,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:48,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:48,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:48,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028954027] [2025-03-17 11:13:48,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028954027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:48,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:48,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:48,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004113725] [2025-03-17 11:13:48,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:48,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:48,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:48,102 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:48,102 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:48,107 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 525 [2025-03-17 11:13:48,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 375 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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-03-17 11:13:48,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:48,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 525 [2025-03-17 11:13:48,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:51,610 INFO L124 PetriNetUnfolderBase]: 10925/29169 cut-off events. [2025-03-17 11:13:51,610 INFO L125 PetriNetUnfolderBase]: For 9299/9299 co-relation queries the response was YES. [2025-03-17 11:13:51,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54564 conditions, 29169 events. 10925/29169 cut-off events. For 9299/9299 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 323348 event pairs, 4510 based on Foata normal form. 0/25056 useless extension candidates. Maximal degree in co-relation 54433. Up to 14071 conditions per place. [2025-03-17 11:13:51,845 INFO L140 encePairwiseOnDemand]: 523/525 looper letters, 42 selfloop transitions, 1 changer transitions 0/374 dead transitions. [2025-03-17 11:13:51,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 374 transitions, 943 flow [2025-03-17 11:13:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:51,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1275 transitions. [2025-03-17 11:13:51,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8095238095238095 [2025-03-17 11:13:51,848 INFO L175 Difference]: Start difference. First operand has 367 places, 375 transitions, 859 flow. Second operand 3 states and 1275 transitions. [2025-03-17 11:13:51,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 374 transitions, 943 flow [2025-03-17 11:13:51,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 374 transitions, 943 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:13:51,858 INFO L231 Difference]: Finished difference. Result has 368 places, 374 transitions, 859 flow [2025-03-17 11:13:51,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=859, PETRI_PLACES=368, PETRI_TRANSITIONS=374} [2025-03-17 11:13:51,858 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -81 predicate places. [2025-03-17 11:13:51,859 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 374 transitions, 859 flow [2025-03-17 11:13:51,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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-03-17 11:13:51,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:51,859 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 11:13:51,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:13:51,860 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 143 more)] === [2025-03-17 11:13:51,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:51,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2084243902, now seen corresponding path program 1 times [2025-03-17 11:13:51,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:51,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029014885] [2025-03-17 11:13:51,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:51,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-17 11:13:51,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-17 11:13:51,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:51,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:51,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:13:51,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:51,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029014885] [2025-03-17 11:13:51,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029014885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:51,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:51,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:51,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285066310] [2025-03-17 11:13:51,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:51,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:51,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:51,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:51,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:51,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 525 [2025-03-17 11:13:51,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 374 transitions, 859 flow. Second operand has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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-03-17 11:13:51,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:51,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 525 [2025-03-17 11:13:51,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:55,482 INFO L124 PetriNetUnfolderBase]: 10925/29168 cut-off events. [2025-03-17 11:13:55,483 INFO L125 PetriNetUnfolderBase]: For 9299/9299 co-relation queries the response was YES. [2025-03-17 11:13:55,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54564 conditions, 29168 events. 10925/29168 cut-off events. For 9299/9299 co-relation queries the response was YES. Maximal size of possible extension queue 963. Compared 322997 event pairs, 4510 based on Foata normal form. 1/25056 useless extension candidates. Maximal degree in co-relation 54550. Up to 14071 conditions per place. [2025-03-17 11:13:55,593 INFO L140 encePairwiseOnDemand]: 523/525 looper letters, 0 selfloop transitions, 0 changer transitions 373/373 dead transitions. [2025-03-17 11:13:55,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 373 transitions, 941 flow [2025-03-17 11:13:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:55,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:55,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1274 transitions. [2025-03-17 11:13:55,595 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8088888888888889 [2025-03-17 11:13:55,595 INFO L175 Difference]: Start difference. First operand has 368 places, 374 transitions, 859 flow. Second operand 3 states and 1274 transitions. [2025-03-17 11:13:55,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 373 transitions, 941 flow [2025-03-17 11:13:55,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 373 transitions, 940 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:55,602 INFO L231 Difference]: Finished difference. Result has 368 places, 0 transitions, 0 flow [2025-03-17 11:13:55,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=525, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=368, PETRI_TRANSITIONS=0} [2025-03-17 11:13:55,603 INFO L279 CegarLoopForPetriNet]: 449 programPoint places, -81 predicate places. [2025-03-17 11:13:55,603 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 0 transitions, 0 flow [2025-03-17 11:13:55,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 420.6666666666667) internal successors, (1262), 3 states have internal predecessors, (1262), 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-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (146 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (145 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (144 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (143 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (142 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (141 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (140 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (139 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (138 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (137 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (136 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (135 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (134 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (133 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (132 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (131 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (130 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (129 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (128 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (127 of 147 remaining) [2025-03-17 11:13:55,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (126 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (125 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (124 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (123 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (122 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (121 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (120 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (119 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (118 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (117 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (116 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (115 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (114 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (113 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (112 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (111 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (110 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (109 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (108 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (107 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (106 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (105 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (104 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (103 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (102 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (101 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (100 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (99 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (98 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (97 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (96 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (95 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (94 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (93 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (92 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (91 of 147 remaining) [2025-03-17 11:13:55,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (90 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (89 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (88 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (86 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (85 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (84 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (83 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (82 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (81 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (80 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (79 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (78 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (77 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (76 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (75 of 147 remaining) [2025-03-17 11:13:55,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (74 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (73 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (72 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (71 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (70 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (69 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (68 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (67 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (66 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (65 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (64 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (63 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (62 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (61 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (60 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (59 of 147 remaining) [2025-03-17 11:13:55,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (58 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (57 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (55 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (54 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (53 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (51 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (50 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (49 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (48 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (46 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (45 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (44 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 147 remaining) [2025-03-17 11:13:55,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (39 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (38 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (37 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (36 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (35 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (33 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (32 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (31 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (30 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (29 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (28 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (27 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (26 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (25 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (24 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork5Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork5Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (21 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (20 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (19 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (18 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (17 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (16 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (15 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (14 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (13 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (12 of 147 remaining) [2025-03-17 11:13:55,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (11 of 147 remaining) [2025-03-17 11:13:55,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (10 of 147 remaining) [2025-03-17 11:13:55,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (9 of 147 remaining) [2025-03-17 11:13:55,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (8 of 147 remaining) [2025-03-17 11:13:55,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (7 of 147 remaining) [2025-03-17 11:13:55,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (6 of 147 remaining) [2025-03-17 11:13:55,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (5 of 147 remaining) [2025-03-17 11:13:55,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (4 of 147 remaining) [2025-03-17 11:13:55,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (3 of 147 remaining) [2025-03-17 11:13:55,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 147 remaining) [2025-03-17 11:13:55,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (1 of 147 remaining) [2025-03-17 11:13:55,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (0 of 147 remaining) [2025-03-17 11:13:55,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:13:55,612 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] [2025-03-17 11:13:55,617 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:13:55,617 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:13:55,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:13:55 BasicIcfg [2025-03-17 11:13:55,623 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:13:55,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:13:55,624 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:13:55,624 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:13:55,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:27" (3/4) ... [2025-03-17 11:13:55,625 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:13:55,627 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:13:55,627 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:13:55,627 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-17 11:13:55,628 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-17 11:13:55,628 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread5 [2025-03-17 11:13:55,628 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread6 [2025-03-17 11:13:55,633 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-03-17 11:13:55,634 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:13:55,634 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:13:55,634 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:13:55,698 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:13:55,698 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:13:55,698 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:13:55,699 INFO L158 Benchmark]: Toolchain (without parser) took 29328.23ms. Allocated memory was 142.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 106.5MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2025-03-17 11:13:55,699 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:55,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.15ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 92.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:13:55,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.91ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 88.5MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:55,699 INFO L158 Benchmark]: Boogie Preprocessor took 38.51ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 85.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:55,700 INFO L158 Benchmark]: IcfgBuilder took 1106.84ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 97.1MB in the end (delta: -11.5MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. [2025-03-17 11:13:55,700 INFO L158 Benchmark]: TraceAbstraction took 27786.77ms. Allocated memory was 142.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 96.4MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2025-03-17 11:13:55,700 INFO L158 Benchmark]: Witness Printer took 74.75ms. Allocated memory is still 5.7GB. Free memory was 3.6GB in the beginning and 3.6GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:13:55,701 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.62ms. Allocated memory is still 201.3MB. Free memory is still 116.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.15ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 92.3MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.91ms. Allocated memory is still 142.6MB. Free memory was 92.3MB in the beginning and 88.5MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.51ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 85.6MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1106.84ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 97.1MB in the end (delta: -11.5MB). Peak memory consumption was 68.9MB. Max. memory is 16.1GB. * TraceAbstraction took 27786.77ms. Allocated memory was 142.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 96.4MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 74.75ms. Allocated memory is still 5.7GB. Free memory was 3.6GB in the beginning and 3.6GB 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: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - 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: 52]: 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: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: 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: 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: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 144]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 145]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 146]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 147]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 148]: 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 - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 177]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: 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: 131]: 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: 133]: 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: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 625 locations, 671 edges, 147 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: 27.6s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 591 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 278 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1616 IncrementalHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 115 mSDtfsCounter, 1616 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=956occurred in iteration=0, InterpolantAutomatonStates: 72, 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.2s InterpolantComputationTime, 2944 NumberOfCodeBlocks, 2944 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2921 ConstructedInterpolants, 0 QuantifiedInterpolants, 3080 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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 83 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:13:55,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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