./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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/goblint-regression/09-regions_19-nested_nr.i -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 e4a3fff277216174585e9d802eee36c2b619da26d56e48ed5261f2ab62942b7a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:59:14,432 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:59:14,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:59:14,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:59:14,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:59:14,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:59:14,510 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:59:14,510 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:59:14,511 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:59:14,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:59:14,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:59:14,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:59:14,512 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:59:14,512 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:59:14,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:59:14,513 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:59:14,513 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:59:14,513 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:59:14,513 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:59:14,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:59:14,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:59:14,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:59:14,513 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:59:14,513 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:59:14,513 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:59:14,513 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:59:14,513 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:59:14,513 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:59:14,514 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:59:14,514 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:59:14,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:59:14,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:59:14,514 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:59:14,514 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:59:14,514 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:59:14,514 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:59:14,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:59:14,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:59:14,515 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:59:14,515 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:59:14,515 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:59:14,515 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:59:14,515 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 -> e4a3fff277216174585e9d802eee36c2b619da26d56e48ed5261f2ab62942b7a [2025-03-08 21:59:14,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:59:14,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:59:14,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:59:14,753 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:59:14,753 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:59:14,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i [2025-03-08 21:59:15,933 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8da6c79a5/f23d65e78e7c4f6ca3d5dd76e42eab04/FLAG035fc744c [2025-03-08 21:59:16,220 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:59:16,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_19-nested_nr.i [2025-03-08 21:59:16,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8da6c79a5/f23d65e78e7c4f6ca3d5dd76e42eab04/FLAG035fc744c [2025-03-08 21:59:16,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8da6c79a5/f23d65e78e7c4f6ca3d5dd76e42eab04 [2025-03-08 21:59:16,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:59:16,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:59:16,261 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:59:16,261 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:59:16,264 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:59:16,265 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:59:16" (1/1) ... [2025-03-08 21:59:16,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4916486d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:16, skipping insertion in model container [2025-03-08 21:59:16,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:59:16" (1/1) ... [2025-03-08 21:59:16,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:59:16,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:59:16,651 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:59:16,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:59:16,770 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:59:16,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:16 WrapperNode [2025-03-08 21:59:16,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:59:16,772 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:59:16,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:59:16,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:59:16,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:16" (1/1) ... [2025-03-08 21:59:16,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:16" (1/1) ... [2025-03-08 21:59:16,810 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 292 [2025-03-08 21:59:16,811 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:59:16,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:59:16,812 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:59:16,812 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:59:16,817 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:16" (1/1) ... [2025-03-08 21:59:16,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:16" (1/1) ... [2025-03-08 21:59:16,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:16" (1/1) ... [2025-03-08 21:59:16,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:16" (1/1) ... [2025-03-08 21:59:16,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:16" (1/1) ... [2025-03-08 21:59:16,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:16" (1/1) ... [2025-03-08 21:59:16,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:16" (1/1) ... [2025-03-08 21:59:16,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:16" (1/1) ... [2025-03-08 21:59:16,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:59:16,866 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:59:16,866 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:59:16,866 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:59:16,867 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:16" (1/1) ... [2025-03-08 21:59:16,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:59:16,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:59:16,898 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-08 21:59:16,903 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-08 21:59:16,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-08 21:59:16,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-08 21:59:16,918 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:59:16,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 21:59:16,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 21:59:16,918 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:59:16,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 21:59:16,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:59:16,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 21:59:16,918 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 21:59:16,918 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 21:59:16,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:59:16,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:59:16,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:59:16,919 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:59:17,053 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:59:17,055 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:59:17,505 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:59:17,505 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:59:17,533 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:59:17,535 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:59:17,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:59:17 BoogieIcfgContainer [2025-03-08 21:59:17,535 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:59:17,537 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:59:17,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:59:17,541 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:59:17,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:59:16" (1/3) ... [2025-03-08 21:59:17,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ceb50d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:59:17, skipping insertion in model container [2025-03-08 21:59:17,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:59:16" (2/3) ... [2025-03-08 21:59:17,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ceb50d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:59:17, skipping insertion in model container [2025-03-08 21:59:17,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:59:17" (3/3) ... [2025-03-08 21:59:17,543 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_19-nested_nr.i [2025-03-08 21:59:17,554 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:59:17,557 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_19-nested_nr.i that has 2 procedures, 334 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-08 21:59:17,557 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:59:17,646 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-08 21:59:17,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 337 places, 337 transitions, 678 flow [2025-03-08 21:59:17,796 INFO L124 PetriNetUnfolderBase]: 4/336 cut-off events. [2025-03-08 21:59:17,798 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:59:17,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 336 events. 4/336 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 413 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 208. Up to 2 conditions per place. [2025-03-08 21:59:17,805 INFO L82 GeneralOperation]: Start removeDead. Operand has 337 places, 337 transitions, 678 flow [2025-03-08 21:59:17,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 336 places, 336 transitions, 675 flow [2025-03-08 21:59:17,817 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:59:17,828 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;@245f2839, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:59:17,828 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-08 21:59:17,850 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:59:17,850 INFO L124 PetriNetUnfolderBase]: 2/126 cut-off events. [2025-03-08 21:59:17,850 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:59:17,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:17,852 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] [2025-03-08 21:59:17,852 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:17,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1208132073, now seen corresponding path program 1 times [2025-03-08 21:59:17,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:17,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564576080] [2025-03-08 21:59:17,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:17,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:17,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 21:59:17,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 21:59:17,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:17,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:18,166 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-08 21:59:18,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:18,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564576080] [2025-03-08 21:59:18,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564576080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:18,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:18,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:59:18,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48398237] [2025-03-08 21:59:18,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:18,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:59:18,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:18,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:59:18,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:59:18,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 337 [2025-03-08 21:59:18,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 336 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 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-08 21:59:18,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:18,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 337 [2025-03-08 21:59:18,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:18,315 INFO L124 PetriNetUnfolderBase]: 8/414 cut-off events. [2025-03-08 21:59:18,315 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:59:18,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 414 events. 8/414 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 890 event pairs, 6 based on Foata normal form. 5/388 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-03-08 21:59:18,318 INFO L140 encePairwiseOnDemand]: 332/337 looper letters, 10 selfloop transitions, 2 changer transitions 1/335 dead transitions. [2025-03-08 21:59:18,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 335 transitions, 697 flow [2025-03-08 21:59:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:59:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:59:18,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 987 transitions. [2025-03-08 21:59:18,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9762611275964391 [2025-03-08 21:59:18,336 INFO L175 Difference]: Start difference. First operand has 336 places, 336 transitions, 675 flow. Second operand 3 states and 987 transitions. [2025-03-08 21:59:18,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 335 transitions, 697 flow [2025-03-08 21:59:18,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 335 transitions, 696 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:59:18,348 INFO L231 Difference]: Finished difference. Result has 338 places, 334 transitions, 680 flow [2025-03-08 21:59:18,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=338, PETRI_TRANSITIONS=334} [2025-03-08 21:59:18,353 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 2 predicate places. [2025-03-08 21:59:18,353 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 334 transitions, 680 flow [2025-03-08 21:59:18,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 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-08 21:59:18,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:18,354 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-08 21:59:18,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:59:18,354 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:18,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:18,355 INFO L85 PathProgramCache]: Analyzing trace with hash 332863575, now seen corresponding path program 1 times [2025-03-08 21:59:18,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:18,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295006073] [2025-03-08 21:59:18,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:18,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:18,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 21:59:18,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 21:59:18,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:18,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:18,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:18,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295006073] [2025-03-08 21:59:18,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295006073] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:59:18,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101651596] [2025-03-08 21:59:18,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:18,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:18,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:59:18,573 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:59:18,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 21:59:18,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 21:59:18,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 21:59:18,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:18,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:18,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:59:18,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:59:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:18,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:59:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:18,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101651596] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:59:18,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:59:18,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:59:18,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563410863] [2025-03-08 21:59:18,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:59:18,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:59:18,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:18,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:59:18,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:59:18,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-08 21:59:18,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 334 transitions, 680 flow. Second operand has 10 states, 10 states have (on average 322.8) internal successors, (3228), 10 states have internal predecessors, (3228), 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-08 21:59:18,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:18,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-08 21:59:18,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:18,882 INFO L124 PetriNetUnfolderBase]: 8/420 cut-off events. [2025-03-08 21:59:18,882 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 21:59:18,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 420 events. 8/420 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 879 event pairs, 6 based on Foata normal form. 2/392 useless extension candidates. Maximal degree in co-relation 384. Up to 24 conditions per place. [2025-03-08 21:59:18,885 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 14 selfloop transitions, 9 changer transitions 0/342 dead transitions. [2025-03-08 21:59:18,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 342 transitions, 744 flow [2025-03-08 21:59:18,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:59:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:59:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2914 transitions. [2025-03-08 21:59:18,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607649192218926 [2025-03-08 21:59:18,892 INFO L175 Difference]: Start difference. First operand has 338 places, 334 transitions, 680 flow. Second operand 9 states and 2914 transitions. [2025-03-08 21:59:18,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 342 transitions, 744 flow [2025-03-08 21:59:18,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 342 transitions, 742 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:59:18,898 INFO L231 Difference]: Finished difference. Result has 347 places, 340 transitions, 728 flow [2025-03-08 21:59:18,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=728, PETRI_PLACES=347, PETRI_TRANSITIONS=340} [2025-03-08 21:59:18,902 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 11 predicate places. [2025-03-08 21:59:18,902 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 340 transitions, 728 flow [2025-03-08 21:59:18,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 322.8) internal successors, (3228), 10 states have internal predecessors, (3228), 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-08 21:59:18,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:18,904 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:18,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 21:59:19,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:19,105 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:19,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:19,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1914851241, now seen corresponding path program 2 times [2025-03-08 21:59:19,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:19,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513920467] [2025-03-08 21:59:19,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:59:19,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:19,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-08 21:59:19,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 97 of 112 statements. [2025-03-08 21:59:19,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:59:19,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 21:59:19,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:19,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513920467] [2025-03-08 21:59:19,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513920467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:19,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:19,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203998622] [2025-03-08 21:59:19,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:19,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:19,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:19,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:19,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:19,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 337 [2025-03-08 21:59:19,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 340 transitions, 728 flow. Second operand has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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-08 21:59:19,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:19,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 337 [2025-03-08 21:59:19,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:20,198 INFO L124 PetriNetUnfolderBase]: 366/1695 cut-off events. [2025-03-08 21:59:20,198 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-08 21:59:20,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2537 conditions, 1695 events. 366/1695 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10149 event pairs, 364 based on Foata normal form. 0/1569 useless extension candidates. Maximal degree in co-relation 2426. Up to 800 conditions per place. [2025-03-08 21:59:20,207 INFO L140 encePairwiseOnDemand]: 325/337 looper letters, 71 selfloop transitions, 10 changer transitions 0/338 dead transitions. [2025-03-08 21:59:20,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 338 transitions, 886 flow [2025-03-08 21:59:20,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:20,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1595 transitions. [2025-03-08 21:59:20,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7888229475766568 [2025-03-08 21:59:20,211 INFO L175 Difference]: Start difference. First operand has 347 places, 340 transitions, 728 flow. Second operand 6 states and 1595 transitions. [2025-03-08 21:59:20,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 338 transitions, 886 flow [2025-03-08 21:59:20,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 338 transitions, 880 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 21:59:20,218 INFO L231 Difference]: Finished difference. Result has 349 places, 338 transitions, 738 flow [2025-03-08 21:59:20,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=738, PETRI_PLACES=349, PETRI_TRANSITIONS=338} [2025-03-08 21:59:20,220 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 13 predicate places. [2025-03-08 21:59:20,220 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 338 transitions, 738 flow [2025-03-08 21:59:20,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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-08 21:59:20,221 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:20,221 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:20,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:59:20,222 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:20,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:20,223 INFO L85 PathProgramCache]: Analyzing trace with hash -613763684, now seen corresponding path program 1 times [2025-03-08 21:59:20,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:20,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239974037] [2025-03-08 21:59:20,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:20,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:20,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 21:59:20,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 21:59:20,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:20,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:20,295 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 21:59:20,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:20,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239974037] [2025-03-08 21:59:20,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239974037] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:20,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:20,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:59:20,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660832747] [2025-03-08 21:59:20,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:20,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:59:20,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:20,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:59:20,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:59:20,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 337 [2025-03-08 21:59:20,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 338 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 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-08 21:59:20,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:20,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 337 [2025-03-08 21:59:20,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:20,398 INFO L124 PetriNetUnfolderBase]: 8/529 cut-off events. [2025-03-08 21:59:20,399 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-08 21:59:20,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 529 events. 8/529 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 871 event pairs, 6 based on Foata normal form. 1/496 useless extension candidates. Maximal degree in co-relation 494. Up to 24 conditions per place. [2025-03-08 21:59:20,400 INFO L140 encePairwiseOnDemand]: 334/337 looper letters, 10 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2025-03-08 21:59:20,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 339 transitions, 764 flow [2025-03-08 21:59:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:59:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:59:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions. [2025-03-08 21:59:20,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9742828882294757 [2025-03-08 21:59:20,403 INFO L175 Difference]: Start difference. First operand has 349 places, 338 transitions, 738 flow. Second operand 3 states and 985 transitions. [2025-03-08 21:59:20,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 339 transitions, 764 flow [2025-03-08 21:59:20,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 339 transitions, 744 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:59:20,408 INFO L231 Difference]: Finished difference. Result has 347 places, 339 transitions, 730 flow [2025-03-08 21:59:20,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=347, PETRI_TRANSITIONS=339} [2025-03-08 21:59:20,409 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 11 predicate places. [2025-03-08 21:59:20,409 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 339 transitions, 730 flow [2025-03-08 21:59:20,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 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-08 21:59:20,410 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:20,410 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:20,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:59:20,410 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:20,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:20,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1974247377, now seen corresponding path program 1 times [2025-03-08 21:59:20,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:20,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015272922] [2025-03-08 21:59:20,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:20,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:20,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 21:59:20,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 21:59:20,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:20,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:20,583 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:20,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:20,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015272922] [2025-03-08 21:59:20,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015272922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:59:20,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654519380] [2025-03-08 21:59:20,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:20,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:20,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:59:20,586 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:59:20,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 21:59:20,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 21:59:20,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 21:59:20,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:20,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:20,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:59:20,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:59:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:20,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:59:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:20,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654519380] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:59:20,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:59:20,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-08 21:59:20,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299134746] [2025-03-08 21:59:20,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:59:20,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 21:59:20,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:20,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 21:59:20,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 21:59:20,853 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-08 21:59:20,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 339 transitions, 730 flow. Second operand has 18 states, 18 states have (on average 322.8888888888889) internal successors, (5812), 18 states have internal predecessors, (5812), 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-08 21:59:20,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:20,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-08 21:59:20,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:21,081 INFO L124 PetriNetUnfolderBase]: 8/549 cut-off events. [2025-03-08 21:59:21,081 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-08 21:59:21,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 661 conditions, 549 events. 8/549 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 868 event pairs, 6 based on Foata normal form. 4/519 useless extension candidates. Maximal degree in co-relation 476. Up to 24 conditions per place. [2025-03-08 21:59:21,083 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 18 selfloop transitions, 21 changer transitions 0/357 dead transitions. [2025-03-08 21:59:21,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 357 transitions, 896 flow [2025-03-08 21:59:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 21:59:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-08 21:59:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6784 transitions. [2025-03-08 21:59:21,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585982761056945 [2025-03-08 21:59:21,093 INFO L175 Difference]: Start difference. First operand has 347 places, 339 transitions, 730 flow. Second operand 21 states and 6784 transitions. [2025-03-08 21:59:21,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 357 transitions, 896 flow [2025-03-08 21:59:21,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 357 transitions, 894 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 21:59:21,098 INFO L231 Difference]: Finished difference. Result has 371 places, 352 transitions, 858 flow [2025-03-08 21:59:21,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=858, PETRI_PLACES=371, PETRI_TRANSITIONS=352} [2025-03-08 21:59:21,099 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 35 predicate places. [2025-03-08 21:59:21,099 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 352 transitions, 858 flow [2025-03-08 21:59:21,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 322.8888888888889) internal successors, (5812), 18 states have internal predecessors, (5812), 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-08 21:59:21,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:21,102 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:21,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 21:59:21,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:21,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:21,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:21,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1033277487, now seen corresponding path program 2 times [2025-03-08 21:59:21,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:21,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651105932] [2025-03-08 21:59:21,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:59:21,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:21,322 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 140 statements into 2 equivalence classes. [2025-03-08 21:59:21,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 105 of 140 statements. [2025-03-08 21:59:21,330 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:59:21,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 21:59:21,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:21,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651105932] [2025-03-08 21:59:21,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651105932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:21,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:21,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:21,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771619544] [2025-03-08 21:59:21,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:21,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:21,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:21,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:21,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:21,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 337 [2025-03-08 21:59:21,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 352 transitions, 858 flow. Second operand has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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-08 21:59:21,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:21,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 337 [2025-03-08 21:59:21,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:22,236 INFO L124 PetriNetUnfolderBase]: 366/1822 cut-off events. [2025-03-08 21:59:22,236 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-08 21:59:22,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 1822 events. 366/1822 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10071 event pairs, 364 based on Foata normal form. 0/1694 useless extension candidates. Maximal degree in co-relation 2581. Up to 830 conditions per place. [2025-03-08 21:59:22,242 INFO L140 encePairwiseOnDemand]: 325/337 looper letters, 71 selfloop transitions, 10 changer transitions 0/350 dead transitions. [2025-03-08 21:59:22,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 350 transitions, 1016 flow [2025-03-08 21:59:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:22,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1595 transitions. [2025-03-08 21:59:22,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7888229475766568 [2025-03-08 21:59:22,247 INFO L175 Difference]: Start difference. First operand has 371 places, 352 transitions, 858 flow. Second operand 6 states and 1595 transitions. [2025-03-08 21:59:22,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 350 transitions, 1016 flow [2025-03-08 21:59:22,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 350 transitions, 992 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-08 21:59:22,252 INFO L231 Difference]: Finished difference. Result has 368 places, 350 transitions, 850 flow [2025-03-08 21:59:22,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=850, PETRI_PLACES=368, PETRI_TRANSITIONS=350} [2025-03-08 21:59:22,253 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 32 predicate places. [2025-03-08 21:59:22,253 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 350 transitions, 850 flow [2025-03-08 21:59:22,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 253.33333333333334) internal successors, (1520), 6 states have internal predecessors, (1520), 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-08 21:59:22,254 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:22,254 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:22,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:59:22,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:22,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:22,255 INFO L85 PathProgramCache]: Analyzing trace with hash 565403644, now seen corresponding path program 1 times [2025-03-08 21:59:22,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:22,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873014183] [2025-03-08 21:59:22,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:22,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:22,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 21:59:22,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 21:59:22,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:22,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:22,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:22,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873014183] [2025-03-08 21:59:22,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873014183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:59:22,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932750154] [2025-03-08 21:59:22,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:22,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:22,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:59:22,571 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:59:22,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 21:59:22,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-08 21:59:22,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-08 21:59:22,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:22,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:22,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 21:59:22,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:59:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:22,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:59:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:59:22,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932750154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:59:22,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:59:22,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-08 21:59:22,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606080373] [2025-03-08 21:59:22,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:59:22,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 21:59:22,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:22,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 21:59:22,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-08 21:59:22,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-08 21:59:22,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 350 transitions, 850 flow. Second operand has 23 states, 23 states have (on average 323.0) internal successors, (7429), 23 states have internal predecessors, (7429), 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-08 21:59:22,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:22,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-08 21:59:22,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:23,274 INFO L124 PetriNetUnfolderBase]: 8/560 cut-off events. [2025-03-08 21:59:23,277 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-08 21:59:23,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 560 events. 8/560 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 854 event pairs, 6 based on Foata normal form. 3/533 useless extension candidates. Maximal degree in co-relation 498. Up to 24 conditions per place. [2025-03-08 21:59:23,279 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 21 selfloop transitions, 30 changer transitions 0/367 dead transitions. [2025-03-08 21:59:23,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 367 transitions, 1074 flow [2025-03-08 21:59:23,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 21:59:23,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-08 21:59:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9684 transitions. [2025-03-08 21:59:23,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578635014836795 [2025-03-08 21:59:23,296 INFO L175 Difference]: Start difference. First operand has 368 places, 350 transitions, 850 flow. Second operand 30 states and 9684 transitions. [2025-03-08 21:59:23,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 367 transitions, 1074 flow [2025-03-08 21:59:23,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 367 transitions, 1054 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:59:23,306 INFO L231 Difference]: Finished difference. Result has 396 places, 360 transitions, 982 flow [2025-03-08 21:59:23,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=830, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=982, PETRI_PLACES=396, PETRI_TRANSITIONS=360} [2025-03-08 21:59:23,307 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 60 predicate places. [2025-03-08 21:59:23,307 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 360 transitions, 982 flow [2025-03-08 21:59:23,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 323.0) internal successors, (7429), 23 states have internal predecessors, (7429), 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-08 21:59:23,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:23,310 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:23,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 21:59:23,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:23,510 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:23,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:23,511 INFO L85 PathProgramCache]: Analyzing trace with hash -470579780, now seen corresponding path program 2 times [2025-03-08 21:59:23,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:23,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939134136] [2025-03-08 21:59:23,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:59:23,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:23,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 167 statements into 2 equivalence classes. [2025-03-08 21:59:23,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 117 of 167 statements. [2025-03-08 21:59:23,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:59:23,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 21:59:23,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:23,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939134136] [2025-03-08 21:59:23,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939134136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:23,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:23,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:23,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927358948] [2025-03-08 21:59:23,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:23,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:23,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:23,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:23,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:24,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 337 [2025-03-08 21:59:24,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 360 transitions, 982 flow. Second operand has 6 states, 6 states have (on average 249.83333333333334) internal successors, (1499), 6 states have internal predecessors, (1499), 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-08 21:59:24,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:24,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 337 [2025-03-08 21:59:24,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:24,514 INFO L124 PetriNetUnfolderBase]: 392/1925 cut-off events. [2025-03-08 21:59:24,514 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2025-03-08 21:59:24,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3002 conditions, 1925 events. 392/1925 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10787 event pairs, 390 based on Foata normal form. 0/1793 useless extension candidates. Maximal degree in co-relation 2732. Up to 899 conditions per place. [2025-03-08 21:59:24,522 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 83 selfloop transitions, 5 changer transitions 0/359 dead transitions. [2025-03-08 21:59:24,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 359 transitions, 1156 flow [2025-03-08 21:59:24,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1570 transitions. [2025-03-08 21:59:24,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7764589515331355 [2025-03-08 21:59:24,525 INFO L175 Difference]: Start difference. First operand has 396 places, 360 transitions, 982 flow. Second operand 6 states and 1570 transitions. [2025-03-08 21:59:24,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 359 transitions, 1156 flow [2025-03-08 21:59:24,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 359 transitions, 1110 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-08 21:59:24,532 INFO L231 Difference]: Finished difference. Result has 382 places, 359 transitions, 944 flow [2025-03-08 21:59:24,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=944, PETRI_PLACES=382, PETRI_TRANSITIONS=359} [2025-03-08 21:59:24,535 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 46 predicate places. [2025-03-08 21:59:24,535 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 359 transitions, 944 flow [2025-03-08 21:59:24,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 249.83333333333334) internal successors, (1499), 6 states have internal predecessors, (1499), 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-08 21:59:24,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:24,536 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:24,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:59:24,537 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:24,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:24,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1154900424, now seen corresponding path program 1 times [2025-03-08 21:59:24,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:24,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286260878] [2025-03-08 21:59:24,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:24,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:24,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-08 21:59:24,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-08 21:59:24,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:24,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 21:59:24,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:24,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286260878] [2025-03-08 21:59:24,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286260878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:24,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:24,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:24,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637768047] [2025-03-08 21:59:24,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:24,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:24,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:24,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:24,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:25,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 273 out of 337 [2025-03-08 21:59:25,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 359 transitions, 944 flow. Second operand has 6 states, 6 states have (on average 277.8333333333333) internal successors, (1667), 6 states have internal predecessors, (1667), 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-08 21:59:25,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:25,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 273 of 337 [2025-03-08 21:59:25,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:25,723 INFO L124 PetriNetUnfolderBase]: 56/799 cut-off events. [2025-03-08 21:59:25,723 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-08 21:59:25,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 799 events. 56/799 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2633 event pairs, 54 based on Foata normal form. 0/747 useless extension candidates. Maximal degree in co-relation 911. Up to 195 conditions per place. [2025-03-08 21:59:25,726 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 57 selfloop transitions, 5 changer transitions 0/358 dead transitions. [2025-03-08 21:59:25,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 358 transitions, 1066 flow [2025-03-08 21:59:25,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1700 transitions. [2025-03-08 21:59:25,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8407517309594461 [2025-03-08 21:59:25,729 INFO L175 Difference]: Start difference. First operand has 382 places, 359 transitions, 944 flow. Second operand 6 states and 1700 transitions. [2025-03-08 21:59:25,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 358 transitions, 1066 flow [2025-03-08 21:59:25,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 358 transitions, 1056 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:59:25,734 INFO L231 Difference]: Finished difference. Result has 381 places, 358 transitions, 942 flow [2025-03-08 21:59:25,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=381, PETRI_TRANSITIONS=358} [2025-03-08 21:59:25,735 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 45 predicate places. [2025-03-08 21:59:25,735 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 358 transitions, 942 flow [2025-03-08 21:59:25,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 277.8333333333333) internal successors, (1667), 6 states have internal predecessors, (1667), 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-08 21:59:25,736 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:25,736 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:25,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:59:25,736 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:25,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash 14038114, now seen corresponding path program 1 times [2025-03-08 21:59:25,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:25,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832902155] [2025-03-08 21:59:25,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:25,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:25,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 21:59:25,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 21:59:25,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:25,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 21:59:26,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:26,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832902155] [2025-03-08 21:59:26,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832902155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:26,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:26,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:26,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812663707] [2025-03-08 21:59:26,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:26,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:26,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:26,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:26,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:26,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-08 21:59:26,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 358 transitions, 942 flow. Second operand has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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-08 21:59:26,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:26,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-08 21:59:26,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:26,597 INFO L124 PetriNetUnfolderBase]: 38/714 cut-off events. [2025-03-08 21:59:26,598 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-08 21:59:26,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 714 events. 38/714 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2090 event pairs, 36 based on Foata normal form. 0/675 useless extension candidates. Maximal degree in co-relation 791. Up to 158 conditions per place. [2025-03-08 21:59:26,600 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 53 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2025-03-08 21:59:26,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 357 transitions, 1056 flow [2025-03-08 21:59:26,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:26,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1715 transitions. [2025-03-08 21:59:26,603 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8481701285855588 [2025-03-08 21:59:26,603 INFO L175 Difference]: Start difference. First operand has 381 places, 358 transitions, 942 flow. Second operand 6 states and 1715 transitions. [2025-03-08 21:59:26,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 357 transitions, 1056 flow [2025-03-08 21:59:26,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 357 transitions, 1046 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:59:26,609 INFO L231 Difference]: Finished difference. Result has 380 places, 357 transitions, 940 flow [2025-03-08 21:59:26,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=940, PETRI_PLACES=380, PETRI_TRANSITIONS=357} [2025-03-08 21:59:26,611 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 44 predicate places. [2025-03-08 21:59:26,611 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 357 transitions, 940 flow [2025-03-08 21:59:26,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 280.5) internal successors, (1683), 6 states have internal predecessors, (1683), 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-08 21:59:26,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:26,612 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:26,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:59:26,613 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:26,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1162808924, now seen corresponding path program 1 times [2025-03-08 21:59:26,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:26,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828617380] [2025-03-08 21:59:26,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:26,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:26,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-08 21:59:26,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-08 21:59:26,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:26,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-08 21:59:27,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:27,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828617380] [2025-03-08 21:59:27,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828617380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:27,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:27,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:27,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376711595] [2025-03-08 21:59:27,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:27,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:27,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:27,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:27,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:27,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 337 [2025-03-08 21:59:27,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 357 transitions, 940 flow. Second operand has 6 states, 6 states have (on average 256.1666666666667) internal successors, (1537), 6 states have internal predecessors, (1537), 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-08 21:59:27,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:27,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 337 [2025-03-08 21:59:27,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:27,411 INFO L124 PetriNetUnfolderBase]: 366/1829 cut-off events. [2025-03-08 21:59:27,411 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-08 21:59:27,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2841 conditions, 1829 events. 366/1829 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10003 event pairs, 364 based on Foata normal form. 0/1709 useless extension candidates. Maximal degree in co-relation 2594. Up to 846 conditions per place. [2025-03-08 21:59:27,419 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 79 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-03-08 21:59:27,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 356 transitions, 1106 flow [2025-03-08 21:59:27,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1585 transitions. [2025-03-08 21:59:27,422 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7838773491592482 [2025-03-08 21:59:27,422 INFO L175 Difference]: Start difference. First operand has 380 places, 357 transitions, 940 flow. Second operand 6 states and 1585 transitions. [2025-03-08 21:59:27,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 356 transitions, 1106 flow [2025-03-08 21:59:27,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 356 transitions, 1096 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:59:27,463 INFO L231 Difference]: Finished difference. Result has 379 places, 356 transitions, 938 flow [2025-03-08 21:59:27,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=938, PETRI_PLACES=379, PETRI_TRANSITIONS=356} [2025-03-08 21:59:27,464 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 43 predicate places. [2025-03-08 21:59:27,464 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 356 transitions, 938 flow [2025-03-08 21:59:27,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 256.1666666666667) internal successors, (1537), 6 states have internal predecessors, (1537), 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-08 21:59:27,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:27,466 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:27,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 21:59:27,467 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:27,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:27,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1435550399, now seen corresponding path program 1 times [2025-03-08 21:59:27,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:27,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829157814] [2025-03-08 21:59:27,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:27,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:27,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-08 21:59:27,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-08 21:59:27,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:27,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:27,951 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-08 21:59:27,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:27,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829157814] [2025-03-08 21:59:27,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829157814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:27,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:27,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:27,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518388782] [2025-03-08 21:59:27,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:27,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:27,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:27,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:27,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:28,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 337 [2025-03-08 21:59:28,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 356 transitions, 938 flow. Second operand has 6 states, 6 states have (on average 257.6666666666667) internal successors, (1546), 6 states have internal predecessors, (1546), 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-08 21:59:28,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:28,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 337 [2025-03-08 21:59:28,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:28,371 INFO L124 PetriNetUnfolderBase]: 366/1827 cut-off events. [2025-03-08 21:59:28,372 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-08 21:59:28,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2837 conditions, 1827 events. 366/1827 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9974 event pairs, 364 based on Foata normal form. 0/1709 useless extension candidates. Maximal degree in co-relation 2590. Up to 844 conditions per place. [2025-03-08 21:59:28,378 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 78 selfloop transitions, 5 changer transitions 0/355 dead transitions. [2025-03-08 21:59:28,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 355 transitions, 1102 flow [2025-03-08 21:59:28,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1590 transitions. [2025-03-08 21:59:28,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7863501483679525 [2025-03-08 21:59:28,380 INFO L175 Difference]: Start difference. First operand has 379 places, 356 transitions, 938 flow. Second operand 6 states and 1590 transitions. [2025-03-08 21:59:28,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 355 transitions, 1102 flow [2025-03-08 21:59:28,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 355 transitions, 1092 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:59:28,385 INFO L231 Difference]: Finished difference. Result has 378 places, 355 transitions, 936 flow [2025-03-08 21:59:28,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=936, PETRI_PLACES=378, PETRI_TRANSITIONS=355} [2025-03-08 21:59:28,387 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 42 predicate places. [2025-03-08 21:59:28,387 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 355 transitions, 936 flow [2025-03-08 21:59:28,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 257.6666666666667) internal successors, (1546), 6 states have internal predecessors, (1546), 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-08 21:59:28,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:28,388 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:28,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 21:59:28,388 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:28,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:28,390 INFO L85 PathProgramCache]: Analyzing trace with hash -28368906, now seen corresponding path program 1 times [2025-03-08 21:59:28,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:28,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607862658] [2025-03-08 21:59:28,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:28,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:28,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-08 21:59:28,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-08 21:59:28,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:28,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-08 21:59:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:28,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607862658] [2025-03-08 21:59:28,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607862658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:59:28,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707674261] [2025-03-08 21:59:28,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:28,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:28,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:59:28,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:59:28,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 21:59:28,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-08 21:59:28,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-08 21:59:28,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:28,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:28,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 21:59:28,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:59:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-08 21:59:28,796 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:59:28,926 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-08 21:59:28,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707674261] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:59:28,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:59:28,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 21:59:28,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365190798] [2025-03-08 21:59:28,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:59:28,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 21:59:28,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:28,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 21:59:28,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 21:59:29,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-08 21:59:29,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 355 transitions, 936 flow. Second operand has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 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-08 21:59:29,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:29,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-08 21:59:29,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:29,148 INFO L124 PetriNetUnfolderBase]: 8/657 cut-off events. [2025-03-08 21:59:29,148 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-08 21:59:29,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 657 events. 8/657 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 393 event pairs, 6 based on Foata normal form. 2/639 useless extension candidates. Maximal degree in co-relation 607. Up to 24 conditions per place. [2025-03-08 21:59:29,150 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 14 selfloop transitions, 9 changer transitions 0/363 dead transitions. [2025-03-08 21:59:29,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 363 transitions, 1000 flow [2025-03-08 21:59:29,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 21:59:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 21:59:29,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2914 transitions. [2025-03-08 21:59:29,153 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607649192218926 [2025-03-08 21:59:29,154 INFO L175 Difference]: Start difference. First operand has 378 places, 355 transitions, 936 flow. Second operand 9 states and 2914 transitions. [2025-03-08 21:59:29,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 363 transitions, 1000 flow [2025-03-08 21:59:29,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 363 transitions, 990 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 21:59:29,159 INFO L231 Difference]: Finished difference. Result has 384 places, 361 transitions, 976 flow [2025-03-08 21:59:29,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=926, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=976, PETRI_PLACES=384, PETRI_TRANSITIONS=361} [2025-03-08 21:59:29,160 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 48 predicate places. [2025-03-08 21:59:29,160 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 361 transitions, 976 flow [2025-03-08 21:59:29,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 323.0) internal successors, (3230), 10 states have internal predecessors, (3230), 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-08 21:59:29,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:29,163 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:29,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 21:59:29,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:29,364 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:29,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:29,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1373252938, now seen corresponding path program 2 times [2025-03-08 21:59:29,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:29,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170874522] [2025-03-08 21:59:29,366 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:59:29,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:29,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 463 statements into 2 equivalence classes. [2025-03-08 21:59:29,415 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 98 of 463 statements. [2025-03-08 21:59:29,415 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:59:29,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2025-03-08 21:59:29,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:29,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170874522] [2025-03-08 21:59:29,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170874522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:29,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:29,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:29,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704450488] [2025-03-08 21:59:29,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:29,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:29,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:29,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:29,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:30,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-08 21:59:30,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 361 transitions, 976 flow. Second operand has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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-08 21:59:30,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:30,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-08 21:59:30,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:30,694 INFO L124 PetriNetUnfolderBase]: 258/1984 cut-off events. [2025-03-08 21:59:30,694 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-08 21:59:30,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2787 conditions, 1984 events. 258/1984 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10203 event pairs, 36 based on Foata normal form. 0/1858 useless extension candidates. Maximal degree in co-relation 2536. Up to 491 conditions per place. [2025-03-08 21:59:30,703 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 67 selfloop transitions, 70 changer transitions 0/439 dead transitions. [2025-03-08 21:59:30,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 439 transitions, 1406 flow [2025-03-08 21:59:30,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:30,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:30,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1794 transitions. [2025-03-08 21:59:30,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887240356083086 [2025-03-08 21:59:30,705 INFO L175 Difference]: Start difference. First operand has 384 places, 361 transitions, 976 flow. Second operand 6 states and 1794 transitions. [2025-03-08 21:59:30,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 439 transitions, 1406 flow [2025-03-08 21:59:30,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 439 transitions, 1400 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 21:59:30,712 INFO L231 Difference]: Finished difference. Result has 393 places, 430 transitions, 1432 flow [2025-03-08 21:59:30,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=970, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1432, PETRI_PLACES=393, PETRI_TRANSITIONS=430} [2025-03-08 21:59:30,714 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 57 predicate places. [2025-03-08 21:59:30,714 INFO L471 AbstractCegarLoop]: Abstraction has has 393 places, 430 transitions, 1432 flow [2025-03-08 21:59:30,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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-08 21:59:30,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:30,715 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:30,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 21:59:30,715 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:30,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:30,717 INFO L85 PathProgramCache]: Analyzing trace with hash -296968099, now seen corresponding path program 1 times [2025-03-08 21:59:30,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:30,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183309461] [2025-03-08 21:59:30,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:30,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:30,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-08 21:59:30,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-08 21:59:30,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:30,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-08 21:59:31,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:31,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183309461] [2025-03-08 21:59:31,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183309461] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:59:31,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373070674] [2025-03-08 21:59:31,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:31,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:31,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:59:31,097 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:59:31,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 21:59:31,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 469 statements into 1 equivalence classes. [2025-03-08 21:59:31,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 469 of 469 statements. [2025-03-08 21:59:31,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:31,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:31,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 1616 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 21:59:31,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:59:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-08 21:59:31,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:59:31,992 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-08 21:59:31,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373070674] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:59:31,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:59:31,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-08 21:59:31,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761101694] [2025-03-08 21:59:31,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:59:31,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-08 21:59:31,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:31,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-08 21:59:31,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-08 21:59:32,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-08 21:59:32,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 430 transitions, 1432 flow. Second operand has 18 states, 18 states have (on average 323.0) internal successors, (5814), 18 states have internal predecessors, (5814), 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-08 21:59:32,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:32,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-08 21:59:32,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:32,540 INFO L124 PetriNetUnfolderBase]: 121/2050 cut-off events. [2025-03-08 21:59:32,540 INFO L125 PetriNetUnfolderBase]: For 309/329 co-relation queries the response was YES. [2025-03-08 21:59:32,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2852 conditions, 2050 events. 121/2050 cut-off events. For 309/329 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7281 event pairs, 21 based on Foata normal form. 4/1967 useless extension candidates. Maximal degree in co-relation 2597. Up to 206 conditions per place. [2025-03-08 21:59:32,546 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 19 selfloop transitions, 21 changer transitions 0/448 dead transitions. [2025-03-08 21:59:32,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 448 transitions, 1600 flow [2025-03-08 21:59:32,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 21:59:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-08 21:59:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6784 transitions. [2025-03-08 21:59:32,549 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585982761056945 [2025-03-08 21:59:32,549 INFO L175 Difference]: Start difference. First operand has 393 places, 430 transitions, 1432 flow. Second operand 21 states and 6784 transitions. [2025-03-08 21:59:32,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 448 transitions, 1600 flow [2025-03-08 21:59:32,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 413 places, 448 transitions, 1600 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:59:32,557 INFO L231 Difference]: Finished difference. Result has 418 places, 443 transitions, 1562 flow [2025-03-08 21:59:32,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1562, PETRI_PLACES=418, PETRI_TRANSITIONS=443} [2025-03-08 21:59:32,557 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 82 predicate places. [2025-03-08 21:59:32,558 INFO L471 AbstractCegarLoop]: Abstraction has has 418 places, 443 transitions, 1562 flow [2025-03-08 21:59:32,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 323.0) internal successors, (5814), 18 states have internal predecessors, (5814), 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-08 21:59:32,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:32,559 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:32,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 21:59:32,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 21:59:32,760 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:32,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:32,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1319917021, now seen corresponding path program 2 times [2025-03-08 21:59:32,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:32,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290918200] [2025-03-08 21:59:32,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:59:32,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:32,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 889 statements into 2 equivalence classes. [2025-03-08 21:59:32,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 889 statements. [2025-03-08 21:59:32,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:59:32,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3182 trivial. 0 not checked. [2025-03-08 21:59:32,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:32,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290918200] [2025-03-08 21:59:32,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290918200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:32,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:32,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:32,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518414857] [2025-03-08 21:59:32,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:32,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:32,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:32,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:32,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:33,318 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-08 21:59:33,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 443 transitions, 1562 flow. Second operand has 6 states, 6 states have (on average 282.1666666666667) internal successors, (1693), 6 states have internal predecessors, (1693), 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-08 21:59:33,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:33,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-08 21:59:33,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:34,063 INFO L124 PetriNetUnfolderBase]: 501/3119 cut-off events. [2025-03-08 21:59:34,063 INFO L125 PetriNetUnfolderBase]: For 973/1038 co-relation queries the response was YES. [2025-03-08 21:59:34,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5520 conditions, 3119 events. 501/3119 cut-off events. For 973/1038 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16116 event pairs, 92 based on Foata normal form. 16/2978 useless extension candidates. Maximal degree in co-relation 5260. Up to 981 conditions per place. [2025-03-08 21:59:34,073 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 131 selfloop transitions, 130 changer transitions 0/580 dead transitions. [2025-03-08 21:59:34,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 580 transitions, 2734 flow [2025-03-08 21:59:34,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:34,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:34,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1793 transitions. [2025-03-08 21:59:34,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8867457962413452 [2025-03-08 21:59:34,075 INFO L175 Difference]: Start difference. First operand has 418 places, 443 transitions, 1562 flow. Second operand 6 states and 1793 transitions. [2025-03-08 21:59:34,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 580 transitions, 2734 flow [2025-03-08 21:59:34,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 580 transitions, 2710 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-08 21:59:34,084 INFO L231 Difference]: Finished difference. Result has 422 places, 572 transitions, 2766 flow [2025-03-08 21:59:34,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=1538, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2766, PETRI_PLACES=422, PETRI_TRANSITIONS=572} [2025-03-08 21:59:34,085 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 86 predicate places. [2025-03-08 21:59:34,085 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 572 transitions, 2766 flow [2025-03-08 21:59:34,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.1666666666667) internal successors, (1693), 6 states have internal predecessors, (1693), 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-08 21:59:34,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:34,086 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:34,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 21:59:34,086 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:34,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:34,088 INFO L85 PathProgramCache]: Analyzing trace with hash -752290828, now seen corresponding path program 1 times [2025-03-08 21:59:34,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:34,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380256917] [2025-03-08 21:59:34,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:34,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:34,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 899 statements into 1 equivalence classes. [2025-03-08 21:59:34,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 899 of 899 statements. [2025-03-08 21:59:34,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:34,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:35,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-08 21:59:35,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:35,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380256917] [2025-03-08 21:59:35,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380256917] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 21:59:35,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906301732] [2025-03-08 21:59:35,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:35,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 21:59:35,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:59:35,323 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 21:59:35,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 21:59:35,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 899 statements into 1 equivalence classes. [2025-03-08 21:59:35,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 899 of 899 statements. [2025-03-08 21:59:35,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:35,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:35,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 3333 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 21:59:35,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 21:59:36,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-08 21:59:36,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 21:59:37,057 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-08 21:59:37,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906301732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 21:59:37,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 21:59:37,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-08 21:59:37,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826582536] [2025-03-08 21:59:37,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 21:59:37,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 21:59:37,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:37,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 21:59:37,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-08 21:59:37,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 337 [2025-03-08 21:59:37,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 572 transitions, 2766 flow. Second operand has 23 states, 23 states have (on average 323.0869565217391) internal successors, (7431), 23 states have internal predecessors, (7431), 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-08 21:59:37,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:37,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 337 [2025-03-08 21:59:37,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:38,192 INFO L124 PetriNetUnfolderBase]: 382/3130 cut-off events. [2025-03-08 21:59:38,192 INFO L125 PetriNetUnfolderBase]: For 1290/1329 co-relation queries the response was YES. [2025-03-08 21:59:38,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5425 conditions, 3130 events. 382/3130 cut-off events. For 1290/1329 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13204 event pairs, 37 based on Foata normal form. 7/3029 useless extension candidates. Maximal degree in co-relation 5160. Up to 467 conditions per place. [2025-03-08 21:59:38,204 INFO L140 encePairwiseOnDemand]: 331/337 looper letters, 22 selfloop transitions, 30 changer transitions 0/589 dead transitions. [2025-03-08 21:59:38,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 589 transitions, 2992 flow [2025-03-08 21:59:38,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 21:59:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-08 21:59:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9684 transitions. [2025-03-08 21:59:38,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9578635014836795 [2025-03-08 21:59:38,209 INFO L175 Difference]: Start difference. First operand has 422 places, 572 transitions, 2766 flow. Second operand 30 states and 9684 transitions. [2025-03-08 21:59:38,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 589 transitions, 2992 flow [2025-03-08 21:59:38,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 589 transitions, 2992 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 21:59:38,220 INFO L231 Difference]: Finished difference. Result has 455 places, 582 transitions, 2918 flow [2025-03-08 21:59:38,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=2766, PETRI_DIFFERENCE_MINUEND_PLACES=422, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2918, PETRI_PLACES=455, PETRI_TRANSITIONS=582} [2025-03-08 21:59:38,221 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 119 predicate places. [2025-03-08 21:59:38,221 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 582 transitions, 2918 flow [2025-03-08 21:59:38,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 323.0869565217391) internal successors, (7431), 23 states have internal predecessors, (7431), 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-08 21:59:38,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:38,223 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:38,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 21:59:38,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 21:59:38,423 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:38,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:38,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1447337510, now seen corresponding path program 2 times [2025-03-08 21:59:38,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:38,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488764545] [2025-03-08 21:59:38,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 21:59:38,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:38,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1214 statements into 2 equivalence classes. [2025-03-08 21:59:38,536 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 114 of 1214 statements. [2025-03-08 21:59:38,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 21:59:38,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:38,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6470 trivial. 0 not checked. [2025-03-08 21:59:38,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:38,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488764545] [2025-03-08 21:59:38,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488764545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:38,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:38,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:38,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985196309] [2025-03-08 21:59:38,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:38,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:38,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:38,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:38,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:38,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 337 [2025-03-08 21:59:38,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 582 transitions, 2918 flow. Second operand has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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-08 21:59:38,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:38,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 337 [2025-03-08 21:59:38,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:40,243 INFO L124 PetriNetUnfolderBase]: 777/4205 cut-off events. [2025-03-08 21:59:40,243 INFO L125 PetriNetUnfolderBase]: For 3406/3570 co-relation queries the response was YES. [2025-03-08 21:59:40,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8872 conditions, 4205 events. 777/4205 cut-off events. For 3406/3570 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22244 event pairs, 65 based on Foata normal form. 52/4092 useless extension candidates. Maximal degree in co-relation 8603. Up to 1323 conditions per place. [2025-03-08 21:59:40,257 INFO L140 encePairwiseOnDemand]: 314/337 looper letters, 251 selfloop transitions, 131 changer transitions 5/720 dead transitions. [2025-03-08 21:59:40,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 720 transitions, 4592 flow [2025-03-08 21:59:40,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:40,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:40,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1794 transitions. [2025-03-08 21:59:40,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887240356083086 [2025-03-08 21:59:40,258 INFO L175 Difference]: Start difference. First operand has 455 places, 582 transitions, 2918 flow. Second operand 6 states and 1794 transitions. [2025-03-08 21:59:40,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 720 transitions, 4592 flow [2025-03-08 21:59:40,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 720 transitions, 4546 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-08 21:59:40,274 INFO L231 Difference]: Finished difference. Result has 447 places, 710 transitions, 4352 flow [2025-03-08 21:59:40,274 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=2872, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4352, PETRI_PLACES=447, PETRI_TRANSITIONS=710} [2025-03-08 21:59:40,274 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 111 predicate places. [2025-03-08 21:59:40,274 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 710 transitions, 4352 flow [2025-03-08 21:59:40,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.3333333333333) internal successors, (1694), 6 states have internal predecessors, (1694), 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-08 21:59:40,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:40,275 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:40,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 21:59:40,275 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:40,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:40,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1730056866, now seen corresponding path program 1 times [2025-03-08 21:59:40,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:40,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461704398] [2025-03-08 21:59:40,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:40,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:40,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1215 statements into 1 equivalence classes. [2025-03-08 21:59:40,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1215 of 1215 statements. [2025-03-08 21:59:40,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:40,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:59:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6470 trivial. 0 not checked. [2025-03-08 21:59:43,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:59:43,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461704398] [2025-03-08 21:59:43,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461704398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:59:43,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:59:43,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 21:59:43,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271380041] [2025-03-08 21:59:43,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:59:43,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:59:43,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:59:43,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:59:43,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:59:43,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 337 [2025-03-08 21:59:43,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 710 transitions, 4352 flow. Second operand has 6 states, 6 states have (on average 262.6666666666667) internal successors, (1576), 6 states have internal predecessors, (1576), 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-08 21:59:43,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:59:43,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 337 [2025-03-08 21:59:43,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:59:45,015 INFO L124 PetriNetUnfolderBase]: 1309/5603 cut-off events. [2025-03-08 21:59:45,015 INFO L125 PetriNetUnfolderBase]: For 4983/5040 co-relation queries the response was YES. [2025-03-08 21:59:45,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13619 conditions, 5603 events. 1309/5603 cut-off events. For 4983/5040 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33851 event pairs, 369 based on Foata normal form. 11/5369 useless extension candidates. Maximal degree in co-relation 13346. Up to 2549 conditions per place. [2025-03-08 21:59:45,041 INFO L140 encePairwiseOnDemand]: 318/337 looper letters, 316 selfloop transitions, 84 changer transitions 0/789 dead transitions. [2025-03-08 21:59:45,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 789 transitions, 5550 flow [2025-03-08 21:59:45,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 21:59:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 21:59:45,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1672 transitions. [2025-03-08 21:59:45,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8269040553907022 [2025-03-08 21:59:45,042 INFO L175 Difference]: Start difference. First operand has 447 places, 710 transitions, 4352 flow. Second operand 6 states and 1672 transitions. [2025-03-08 21:59:45,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 789 transitions, 5550 flow [2025-03-08 21:59:45,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 789 transitions, 5296 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-03-08 21:59:45,064 INFO L231 Difference]: Finished difference. Result has 456 places, 781 transitions, 4888 flow [2025-03-08 21:59:45,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=4104, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4888, PETRI_PLACES=456, PETRI_TRANSITIONS=781} [2025-03-08 21:59:45,065 INFO L279 CegarLoopForPetriNet]: 336 programPoint places, 120 predicate places. [2025-03-08 21:59:45,065 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 781 transitions, 4888 flow [2025-03-08 21:59:45,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 262.6666666666667) internal successors, (1576), 6 states have internal predecessors, (1576), 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-08 21:59:45,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:59:45,066 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:59:45,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 21:59:45,066 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-08 21:59:45,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:59:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1349632936, now seen corresponding path program 1 times [2025-03-08 21:59:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:59:45,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010628213] [2025-03-08 21:59:45,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:59:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:59:45,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-03-08 21:59:46,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-03-08 21:59:46,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:59:46,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:00:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 2127 proven. 3973 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2025-03-08 22:00:11,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:00:11,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010628213] [2025-03-08 22:00:11,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010628213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:00:11,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242560660] [2025-03-08 22:00:11,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:00:11,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:00:11,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:00:11,857 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:00:11,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 22:00:12,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1221 statements into 1 equivalence classes. [2025-03-08 22:00:13,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1221 of 1221 statements. [2025-03-08 22:00:13,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:00:13,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:00:13,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 4602 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-03-08 22:00:13,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:00:14,009 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 22:00:14,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-08 22:00:14,455 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-08 22:00:14,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-08 22:00:15,186 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-08 22:00:15,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-08 22:00:15,491 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-08 22:00:15,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-08 22:00:16,175 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-08 22:00:16,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-03-08 22:00:16,487 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-08 22:00:16,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-08 22:00:17,577 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-03-08 22:00:17,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-03-08 22:00:18,412 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-08 22:00:18,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-03-08 22:00:19,989 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2025-03-08 22:00:19,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2025-03-08 22:00:21,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-08 22:00:21,665 INFO L349 Elim1Store]: treesize reduction 118, result has 33.0 percent of original size [2025-03-08 22:00:21,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 76 [2025-03-08 22:00:22,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 35 [2025-03-08 22:00:22,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 35 [2025-03-08 22:00:23,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 29 [2025-03-08 22:00:25,053 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-08 22:00:25,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-08 22:00:26,106 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-08 22:00:26,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-08 22:00:28,087 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-08 22:00:28,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-08 22:00:29,126 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-08 22:00:29,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-08 22:00:30,999 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-08 22:00:31,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-08 22:00:32,006 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-08 22:00:32,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-08 22:00:33,914 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-08 22:00:33,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-08 22:00:34,921 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-08 22:00:34,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-08 22:00:36,890 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-08 22:00:36,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-03-08 22:00:37,927 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-08 22:00:37,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64