./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86978482104e316c202a01b019909b1a7fe566ade6200bbc4193c078d7c086e9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:57:55,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:57:56,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:57:56,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:57:56,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:57:56,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:57:56,052 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:57:56,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:57:56,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:57:56,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:57:56,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:57:56,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:57:56,055 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:57:56,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:57:56,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:57:56,057 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:57:56,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:57:56,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:57:56,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:57:56,058 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:57:56,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:57:56,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:57:56,065 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:57:56,065 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:57:56,065 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:57:56,066 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:57:56,066 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:57:56,066 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:57:56,066 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:57:56,066 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:57:56,067 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:57:56,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:57:56,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:57:56,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:57:56,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:57:56,068 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:57:56,068 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:57:56,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:57:56,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:57:56,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:57:56,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:57:56,069 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 86978482104e316c202a01b019909b1a7fe566ade6200bbc4193c078d7c086e9 [2024-10-13 09:57:56,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:57:56,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:57:56,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:57:56,282 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:57:56,282 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:57:56,283 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c [2024-10-13 09:57:57,433 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:57:57,596 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:57:57,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-symm.wvr.c [2024-10-13 09:57:57,605 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d92692b/be0866d719af43b8ba02c285754094f0/FLAG1face7c66 [2024-10-13 09:57:57,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77d92692b/be0866d719af43b8ba02c285754094f0 [2024-10-13 09:57:57,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:57:57,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:57:57,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:57:57,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:57:57,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:57:57,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:57" (1/1) ... [2024-10-13 09:57:57,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@248cbc1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:57, skipping insertion in model container [2024-10-13 09:57:57,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:57" (1/1) ... [2024-10-13 09:57:57,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:57:57,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:57:57,822 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:57:57,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:57:57,850 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:57:57,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:57 WrapperNode [2024-10-13 09:57:57,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:57:57,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:57:57,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:57:57,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:57:57,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:57" (1/1) ... [2024-10-13 09:57:57,861 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:57" (1/1) ... [2024-10-13 09:57:57,878 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 185 [2024-10-13 09:57:57,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:57:57,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:57:57,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:57:57,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:57:57,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:57" (1/1) ... [2024-10-13 09:57:57,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:57" (1/1) ... [2024-10-13 09:57:57,888 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:57" (1/1) ... [2024-10-13 09:57:57,888 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:57" (1/1) ... [2024-10-13 09:57:57,892 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:57" (1/1) ... [2024-10-13 09:57:57,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:57" (1/1) ... [2024-10-13 09:57:57,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:57" (1/1) ... [2024-10-13 09:57:57,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:57" (1/1) ... [2024-10-13 09:57:57,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:57:57,897 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:57:57,897 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:57:57,897 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:57:57,898 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:57" (1/1) ... [2024-10-13 09:57:57,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:57:57,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:57:57,934 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) [2024-10-13 09:57:57,938 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 [2024-10-13 09:57:57,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:57:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:57:57,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:57:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:57:57,979 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:57:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:57:57,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:57:57,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:57:57,980 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:57:58,071 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:57:58,073 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:57:58,376 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:57:58,376 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:57:58,390 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:57:58,391 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-13 09:57:58,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:58 BoogieIcfgContainer [2024-10-13 09:57:58,391 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:57:58,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:57:58,412 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:57:58,415 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:57:58,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:57:57" (1/3) ... [2024-10-13 09:57:58,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7c2e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:58, skipping insertion in model container [2024-10-13 09:57:58,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:57" (2/3) ... [2024-10-13 09:57:58,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7c2e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:58, skipping insertion in model container [2024-10-13 09:57:58,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:58" (3/3) ... [2024-10-13 09:57:58,418 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-symm.wvr.c [2024-10-13 09:57:58,430 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:57:58,430 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-13 09:57:58,430 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:57:58,508 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-13 09:57:58,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 248 places, 255 transitions, 524 flow [2024-10-13 09:57:58,625 INFO L124 PetriNetUnfolderBase]: 14/253 cut-off events. [2024-10-13 09:57:58,625 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:57:58,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 253 events. 14/253 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 416 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2024-10-13 09:57:58,634 INFO L82 GeneralOperation]: Start removeDead. Operand has 248 places, 255 transitions, 524 flow [2024-10-13 09:57:58,640 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 233 transitions, 478 flow [2024-10-13 09:57:58,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:57:58,659 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;@7b7c1be3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:57:58,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-10-13 09:57:58,668 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:57:58,668 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-10-13 09:57:58,668 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:57:58,668 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:58,669 INFO L204 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] [2024-10-13 09:57:58,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:57:58,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:58,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1849191193, now seen corresponding path program 1 times [2024-10-13 09:57:58,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:58,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105536718] [2024-10-13 09:57:58,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:58,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:58,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:58,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:58,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105536718] [2024-10-13 09:57:58,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105536718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:58,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:58,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:58,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192993460] [2024-10-13 09:57:58,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:58,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:58,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:58,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:58,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:58,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2024-10-13 09:57:58,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 233 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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) [2024-10-13 09:57:58,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:58,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2024-10-13 09:57:58,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:58,963 INFO L124 PetriNetUnfolderBase]: 17/407 cut-off events. [2024-10-13 09:57:58,965 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-13 09:57:58,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 407 events. 17/407 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1561 event pairs, 5 based on Foata normal form. 13/355 useless extension candidates. Maximal degree in co-relation 317. Up to 21 conditions per place. [2024-10-13 09:57:58,971 INFO L140 encePairwiseOnDemand]: 246/255 looper letters, 10 selfloop transitions, 2 changer transitions 2/226 dead transitions. [2024-10-13 09:57:58,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 226 transitions, 488 flow [2024-10-13 09:57:58,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2024-10-13 09:57:58,988 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.938562091503268 [2024-10-13 09:57:58,990 INFO L175 Difference]: Start difference. First operand has 228 places, 233 transitions, 478 flow. Second operand 3 states and 718 transitions. [2024-10-13 09:57:58,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 226 transitions, 488 flow [2024-10-13 09:57:58,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 226 transitions, 480 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 09:57:58,998 INFO L231 Difference]: Finished difference. Result has 225 places, 224 transitions, 456 flow [2024-10-13 09:57:59,000 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=225, PETRI_TRANSITIONS=224} [2024-10-13 09:57:59,003 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -3 predicate places. [2024-10-13 09:57:59,005 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 224 transitions, 456 flow [2024-10-13 09:57:59,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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) [2024-10-13 09:57:59,006 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:59,006 INFO L204 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] [2024-10-13 09:57:59,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:57:59,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:57:59,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:59,007 INFO L85 PathProgramCache]: Analyzing trace with hash -947320442, now seen corresponding path program 1 times [2024-10-13 09:57:59,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:59,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720086654] [2024-10-13 09:57:59,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:59,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:59,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:59,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:59,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720086654] [2024-10-13 09:57:59,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720086654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:59,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:59,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:59,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192468729] [2024-10-13 09:57:59,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:59,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:59,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:59,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:59,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:59,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 255 [2024-10-13 09:57:59,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 224 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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) [2024-10-13 09:57:59,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:59,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 255 [2024-10-13 09:57:59,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:59,178 INFO L124 PetriNetUnfolderBase]: 12/329 cut-off events. [2024-10-13 09:57:59,179 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-13 09:57:59,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 329 events. 12/329 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 943 event pairs, 3 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 325. Up to 17 conditions per place. [2024-10-13 09:57:59,182 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 9 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2024-10-13 09:57:59,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 223 transitions, 476 flow [2024-10-13 09:57:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:59,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-10-13 09:57:59,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2024-10-13 09:57:59,186 INFO L175 Difference]: Start difference. First operand has 225 places, 224 transitions, 456 flow. Second operand 3 states and 714 transitions. [2024-10-13 09:57:59,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 223 transitions, 476 flow [2024-10-13 09:57:59,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 223 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:59,191 INFO L231 Difference]: Finished difference. Result has 222 places, 223 transitions, 454 flow [2024-10-13 09:57:59,192 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=222, PETRI_TRANSITIONS=223} [2024-10-13 09:57:59,193 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -6 predicate places. [2024-10-13 09:57:59,193 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 223 transitions, 454 flow [2024-10-13 09:57:59,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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) [2024-10-13 09:57:59,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:59,194 INFO L204 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] [2024-10-13 09:57:59,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:57:59,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:57:59,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:59,195 INFO L85 PathProgramCache]: Analyzing trace with hash 42739571, now seen corresponding path program 1 times [2024-10-13 09:57:59,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:59,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588660181] [2024-10-13 09:57:59,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:59,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:59,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:59,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588660181] [2024-10-13 09:57:59,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588660181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:59,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:59,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:59,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027809639] [2024-10-13 09:57:59,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:59,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:59,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:59,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:59,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:59,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2024-10-13 09:57:59,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 223 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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) [2024-10-13 09:57:59,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:59,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2024-10-13 09:57:59,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:59,321 INFO L124 PetriNetUnfolderBase]: 15/334 cut-off events. [2024-10-13 09:57:59,321 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:57:59,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 334 events. 15/334 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1102 event pairs, 5 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 327. Up to 21 conditions per place. [2024-10-13 09:57:59,326 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 10 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-10-13 09:57:59,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 222 transitions, 476 flow [2024-10-13 09:57:59,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2024-10-13 09:57:59,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.930718954248366 [2024-10-13 09:57:59,330 INFO L175 Difference]: Start difference. First operand has 222 places, 223 transitions, 454 flow. Second operand 3 states and 712 transitions. [2024-10-13 09:57:59,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 222 transitions, 476 flow [2024-10-13 09:57:59,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 222 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:59,333 INFO L231 Difference]: Finished difference. Result has 221 places, 222 transitions, 452 flow [2024-10-13 09:57:59,333 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=221, PETRI_TRANSITIONS=222} [2024-10-13 09:57:59,334 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -7 predicate places. [2024-10-13 09:57:59,334 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 222 transitions, 452 flow [2024-10-13 09:57:59,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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) [2024-10-13 09:57:59,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:59,335 INFO L204 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] [2024-10-13 09:57:59,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:57:59,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:57:59,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:59,336 INFO L85 PathProgramCache]: Analyzing trace with hash 939753265, now seen corresponding path program 1 times [2024-10-13 09:57:59,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:59,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401859640] [2024-10-13 09:57:59,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:59,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:59,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:59,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401859640] [2024-10-13 09:57:59,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401859640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:59,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:59,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:59,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009334732] [2024-10-13 09:57:59,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:59,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:59,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:59,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:59,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:59,388 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 255 [2024-10-13 09:57:59,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 222 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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) [2024-10-13 09:57:59,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:59,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 255 [2024-10-13 09:57:59,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:59,422 INFO L124 PetriNetUnfolderBase]: 12/330 cut-off events. [2024-10-13 09:57:59,422 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-13 09:57:59,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 330 events. 12/330 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 954 event pairs, 3 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 310. Up to 17 conditions per place. [2024-10-13 09:57:59,424 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 9 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2024-10-13 09:57:59,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 221 transitions, 472 flow [2024-10-13 09:57:59,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:59,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-10-13 09:57:59,426 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2024-10-13 09:57:59,426 INFO L175 Difference]: Start difference. First operand has 221 places, 222 transitions, 452 flow. Second operand 3 states and 714 transitions. [2024-10-13 09:57:59,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 221 transitions, 472 flow [2024-10-13 09:57:59,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 221 transitions, 468 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:59,429 INFO L231 Difference]: Finished difference. Result has 220 places, 221 transitions, 450 flow [2024-10-13 09:57:59,429 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=220, PETRI_TRANSITIONS=221} [2024-10-13 09:57:59,430 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -8 predicate places. [2024-10-13 09:57:59,430 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 221 transitions, 450 flow [2024-10-13 09:57:59,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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) [2024-10-13 09:57:59,431 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:59,431 INFO L204 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] [2024-10-13 09:57:59,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:57:59,431 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:57:59,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1325343806, now seen corresponding path program 1 times [2024-10-13 09:57:59,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:59,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463719395] [2024-10-13 09:57:59,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:59,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:59,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:59,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:59,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463719395] [2024-10-13 09:57:59,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463719395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:59,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:59,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:59,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204132377] [2024-10-13 09:57:59,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:59,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:59,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:59,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:59,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:59,510 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2024-10-13 09:57:59,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 221 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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) [2024-10-13 09:57:59,511 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:59,511 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2024-10-13 09:57:59,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:59,562 INFO L124 PetriNetUnfolderBase]: 32/560 cut-off events. [2024-10-13 09:57:59,562 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-13 09:57:59,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 560 events. 32/560 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2686 event pairs, 9 based on Foata normal form. 0/484 useless extension candidates. Maximal degree in co-relation 554. Up to 36 conditions per place. [2024-10-13 09:57:59,565 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 12 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2024-10-13 09:57:59,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 222 transitions, 483 flow [2024-10-13 09:57:59,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:59,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-10-13 09:57:59,567 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2024-10-13 09:57:59,567 INFO L175 Difference]: Start difference. First operand has 220 places, 221 transitions, 450 flow. Second operand 3 states and 717 transitions. [2024-10-13 09:57:59,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 222 transitions, 483 flow [2024-10-13 09:57:59,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 222 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:59,570 INFO L231 Difference]: Finished difference. Result has 218 places, 221 transitions, 461 flow [2024-10-13 09:57:59,570 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=218, PETRI_TRANSITIONS=221} [2024-10-13 09:57:59,571 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -10 predicate places. [2024-10-13 09:57:59,571 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 221 transitions, 461 flow [2024-10-13 09:57:59,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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) [2024-10-13 09:57:59,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:59,572 INFO L204 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] [2024-10-13 09:57:59,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:57:59,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:57:59,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash 317624442, now seen corresponding path program 1 times [2024-10-13 09:57:59,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:59,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42778946] [2024-10-13 09:57:59,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:59,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:59,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:59,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:59,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42778946] [2024-10-13 09:57:59,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42778946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:59,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:59,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:59,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710860233] [2024-10-13 09:57:59,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:59,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:59,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:59,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:59,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:59,643 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2024-10-13 09:57:59,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 221 transitions, 461 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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) [2024-10-13 09:57:59,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:59,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2024-10-13 09:57:59,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:59,706 INFO L124 PetriNetUnfolderBase]: 34/573 cut-off events. [2024-10-13 09:57:59,707 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-10-13 09:57:59,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 573 events. 34/573 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2883 event pairs, 8 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 520. Up to 36 conditions per place. [2024-10-13 09:57:59,709 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 12 selfloop transitions, 3 changer transitions 0/222 dead transitions. [2024-10-13 09:57:59,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 222 transitions, 494 flow [2024-10-13 09:57:59,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-10-13 09:57:59,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9372549019607843 [2024-10-13 09:57:59,710 INFO L175 Difference]: Start difference. First operand has 218 places, 221 transitions, 461 flow. Second operand 3 states and 717 transitions. [2024-10-13 09:57:59,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 222 transitions, 494 flow [2024-10-13 09:57:59,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 222 transitions, 494 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:59,713 INFO L231 Difference]: Finished difference. Result has 218 places, 221 transitions, 476 flow [2024-10-13 09:57:59,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=218, PETRI_TRANSITIONS=221} [2024-10-13 09:57:59,714 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -10 predicate places. [2024-10-13 09:57:59,714 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 221 transitions, 476 flow [2024-10-13 09:57:59,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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) [2024-10-13 09:57:59,715 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:59,715 INFO L204 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] [2024-10-13 09:57:59,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:57:59,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:57:59,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:59,716 INFO L85 PathProgramCache]: Analyzing trace with hash 567017611, now seen corresponding path program 1 times [2024-10-13 09:57:59,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:59,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175646137] [2024-10-13 09:57:59,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:59,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:59,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:59,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175646137] [2024-10-13 09:57:59,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175646137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:59,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:59,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:59,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114916800] [2024-10-13 09:57:59,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:59,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:59,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:59,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:59,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:59,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 255 [2024-10-13 09:57:59,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 221 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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) [2024-10-13 09:57:59,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:59,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 255 [2024-10-13 09:57:59,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:59,825 INFO L124 PetriNetUnfolderBase]: 25/689 cut-off events. [2024-10-13 09:57:59,826 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2024-10-13 09:57:59,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 689 events. 25/689 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3462 event pairs, 2 based on Foata normal form. 0/620 useless extension candidates. Maximal degree in co-relation 623. Up to 32 conditions per place. [2024-10-13 09:57:59,829 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 12 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2024-10-13 09:57:59,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 224 transitions, 513 flow [2024-10-13 09:57:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-10-13 09:57:59,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9464052287581699 [2024-10-13 09:57:59,831 INFO L175 Difference]: Start difference. First operand has 218 places, 221 transitions, 476 flow. Second operand 3 states and 724 transitions. [2024-10-13 09:57:59,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 224 transitions, 513 flow [2024-10-13 09:57:59,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 224 transitions, 513 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:59,834 INFO L231 Difference]: Finished difference. Result has 219 places, 221 transitions, 486 flow [2024-10-13 09:57:59,834 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=219, PETRI_TRANSITIONS=221} [2024-10-13 09:57:59,835 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -9 predicate places. [2024-10-13 09:57:59,836 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 221 transitions, 486 flow [2024-10-13 09:57:59,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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) [2024-10-13 09:57:59,836 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:59,836 INFO L204 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] [2024-10-13 09:57:59,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:57:59,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:57:59,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:59,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1048582861, now seen corresponding path program 1 times [2024-10-13 09:57:59,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:59,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460903980] [2024-10-13 09:57:59,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:59,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:59,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:59,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:59,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460903980] [2024-10-13 09:57:59,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460903980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:59,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:59,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:59,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697722061] [2024-10-13 09:57:59,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:59,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:59,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:59,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:59,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:59,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 255 [2024-10-13 09:57:59,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 221 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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) [2024-10-13 09:57:59,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:59,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 255 [2024-10-13 09:57:59,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:59,957 INFO L124 PetriNetUnfolderBase]: 26/630 cut-off events. [2024-10-13 09:57:59,957 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2024-10-13 09:57:59,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 630 events. 26/630 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3003 event pairs, 4 based on Foata normal form. 2/570 useless extension candidates. Maximal degree in co-relation 591. Up to 25 conditions per place. [2024-10-13 09:57:59,961 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 10 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2024-10-13 09:57:59,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 221 transitions, 511 flow [2024-10-13 09:57:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2024-10-13 09:57:59,963 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.938562091503268 [2024-10-13 09:57:59,963 INFO L175 Difference]: Start difference. First operand has 219 places, 221 transitions, 486 flow. Second operand 3 states and 718 transitions. [2024-10-13 09:57:59,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 221 transitions, 511 flow [2024-10-13 09:57:59,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 221 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:57:59,966 INFO L231 Difference]: Finished difference. Result has 220 places, 220 transitions, 488 flow [2024-10-13 09:57:59,967 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=220, PETRI_TRANSITIONS=220} [2024-10-13 09:57:59,968 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -8 predicate places. [2024-10-13 09:57:59,968 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 220 transitions, 488 flow [2024-10-13 09:57:59,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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) [2024-10-13 09:57:59,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:59,969 INFO L204 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] [2024-10-13 09:57:59,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:57:59,969 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:57:59,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:59,970 INFO L85 PathProgramCache]: Analyzing trace with hash -556902577, now seen corresponding path program 1 times [2024-10-13 09:57:59,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:59,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928132036] [2024-10-13 09:57:59,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:59,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:00,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:00,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928132036] [2024-10-13 09:58:00,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928132036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:00,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:00,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:00,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857843537] [2024-10-13 09:58:00,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:00,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:00,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:00,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:00,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:00,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 255 [2024-10-13 09:58:00,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 220 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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) [2024-10-13 09:58:00,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:00,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 255 [2024-10-13 09:58:00,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:00,088 INFO L124 PetriNetUnfolderBase]: 26/722 cut-off events. [2024-10-13 09:58:00,088 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2024-10-13 09:58:00,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 819 conditions, 722 events. 26/722 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3772 event pairs, 4 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 681. Up to 33 conditions per place. [2024-10-13 09:58:00,092 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 12 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2024-10-13 09:58:00,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 223 transitions, 525 flow [2024-10-13 09:58:00,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:00,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:00,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-10-13 09:58:00,097 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9464052287581699 [2024-10-13 09:58:00,097 INFO L175 Difference]: Start difference. First operand has 220 places, 220 transitions, 488 flow. Second operand 3 states and 724 transitions. [2024-10-13 09:58:00,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 223 transitions, 525 flow [2024-10-13 09:58:00,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 223 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:00,100 INFO L231 Difference]: Finished difference. Result has 219 places, 220 transitions, 494 flow [2024-10-13 09:58:00,100 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=219, PETRI_TRANSITIONS=220} [2024-10-13 09:58:00,101 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -9 predicate places. [2024-10-13 09:58:00,101 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 220 transitions, 494 flow [2024-10-13 09:58:00,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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) [2024-10-13 09:58:00,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:00,102 INFO L204 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] [2024-10-13 09:58:00,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:58:00,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:58:00,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:00,106 INFO L85 PathProgramCache]: Analyzing trace with hash 304350489, now seen corresponding path program 1 times [2024-10-13 09:58:00,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:00,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914365897] [2024-10-13 09:58:00,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:00,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:00,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:00,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:00,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914365897] [2024-10-13 09:58:00,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914365897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:00,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:00,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:00,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048804174] [2024-10-13 09:58:00,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:00,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:00,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:00,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:00,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:00,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 255 [2024-10-13 09:58:00,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 220 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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) [2024-10-13 09:58:00,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:00,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 255 [2024-10-13 09:58:00,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:00,222 INFO L124 PetriNetUnfolderBase]: 33/577 cut-off events. [2024-10-13 09:58:00,223 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2024-10-13 09:58:00,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 577 events. 33/577 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2632 event pairs, 4 based on Foata normal form. 0/534 useless extension candidates. Maximal degree in co-relation 569. Up to 47 conditions per place. [2024-10-13 09:58:00,225 INFO L140 encePairwiseOnDemand]: 252/255 looper letters, 10 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2024-10-13 09:58:00,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 220 transitions, 519 flow [2024-10-13 09:58:00,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:00,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:00,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2024-10-13 09:58:00,227 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.938562091503268 [2024-10-13 09:58:00,227 INFO L175 Difference]: Start difference. First operand has 219 places, 220 transitions, 494 flow. Second operand 3 states and 718 transitions. [2024-10-13 09:58:00,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 220 transitions, 519 flow [2024-10-13 09:58:00,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 220 transitions, 519 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:58:00,230 INFO L231 Difference]: Finished difference. Result has 220 places, 219 transitions, 496 flow [2024-10-13 09:58:00,231 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=220, PETRI_TRANSITIONS=219} [2024-10-13 09:58:00,232 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -8 predicate places. [2024-10-13 09:58:00,232 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 219 transitions, 496 flow [2024-10-13 09:58:00,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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) [2024-10-13 09:58:00,232 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:00,233 INFO L204 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] [2024-10-13 09:58:00,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:58:00,233 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:58:00,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:00,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1684243623, now seen corresponding path program 1 times [2024-10-13 09:58:00,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:00,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831469318] [2024-10-13 09:58:00,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:00,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:00,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:00,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:00,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831469318] [2024-10-13 09:58:00,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831469318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:00,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:00,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:00,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346337999] [2024-10-13 09:58:00,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:00,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:00,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:00,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:00,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:00,297 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2024-10-13 09:58:00,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 219 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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) [2024-10-13 09:58:00,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:00,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2024-10-13 09:58:00,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:00,347 INFO L124 PetriNetUnfolderBase]: 21/625 cut-off events. [2024-10-13 09:58:00,347 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-10-13 09:58:00,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 625 events. 21/625 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2930 event pairs, 2 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 605. Up to 18 conditions per place. [2024-10-13 09:58:00,353 INFO L140 encePairwiseOnDemand]: 251/255 looper letters, 10 selfloop transitions, 1 changer transitions 0/216 dead transitions. [2024-10-13 09:58:00,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 216 transitions, 512 flow [2024-10-13 09:58:00,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-10-13 09:58:00,356 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9320261437908497 [2024-10-13 09:58:00,357 INFO L175 Difference]: Start difference. First operand has 220 places, 219 transitions, 496 flow. Second operand 3 states and 713 transitions. [2024-10-13 09:58:00,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 216 transitions, 512 flow [2024-10-13 09:58:00,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 216 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:00,360 INFO L231 Difference]: Finished difference. Result has 217 places, 216 transitions, 488 flow [2024-10-13 09:58:00,361 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=217, PETRI_TRANSITIONS=216} [2024-10-13 09:58:00,361 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -11 predicate places. [2024-10-13 09:58:00,361 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 216 transitions, 488 flow [2024-10-13 09:58:00,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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) [2024-10-13 09:58:00,362 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:00,362 INFO L204 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] [2024-10-13 09:58:00,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:58:00,362 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 32 more)] === [2024-10-13 09:58:00,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:00,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1306588128, now seen corresponding path program 1 times [2024-10-13 09:58:00,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:00,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985187725] [2024-10-13 09:58:00,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:00,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:00,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:00,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985187725] [2024-10-13 09:58:00,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985187725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:00,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:00,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:00,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453206375] [2024-10-13 09:58:00,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:00,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:00,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:00,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:00,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:00,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 255 [2024-10-13 09:58:00,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 216 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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) [2024-10-13 09:58:00,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:00,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 255 [2024-10-13 09:58:00,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:00,471 INFO L124 PetriNetUnfolderBase]: 23/596 cut-off events. [2024-10-13 09:58:00,472 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2024-10-13 09:58:00,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694 conditions, 596 events. 23/596 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2505 event pairs, 2 based on Foata normal form. 2/565 useless extension candidates. Maximal degree in co-relation 556. Up to 25 conditions per place. [2024-10-13 09:58:00,474 INFO L140 encePairwiseOnDemand]: 249/255 looper letters, 0 selfloop transitions, 0 changer transitions 215/215 dead transitions. [2024-10-13 09:58:00,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 215 transitions, 510 flow [2024-10-13 09:58:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:00,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:00,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-10-13 09:58:00,476 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2024-10-13 09:58:00,476 INFO L175 Difference]: Start difference. First operand has 217 places, 216 transitions, 488 flow. Second operand 3 states and 714 transitions. [2024-10-13 09:58:00,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 215 transitions, 510 flow [2024-10-13 09:58:00,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 215 transitions, 509 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:58:00,478 INFO L231 Difference]: Finished difference. Result has 215 places, 0 transitions, 0 flow [2024-10-13 09:58:00,478 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=215, PETRI_TRANSITIONS=0} [2024-10-13 09:58:00,479 INFO L277 CegarLoopForPetriNet]: 228 programPoint places, -13 predicate places. [2024-10-13 09:58:00,479 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 0 transitions, 0 flow [2024-10-13 09:58:00,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 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) [2024-10-13 09:58:00,481 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (35 of 36 remaining) [2024-10-13 09:58:00,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (34 of 36 remaining) [2024-10-13 09:58:00,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (33 of 36 remaining) [2024-10-13 09:58:00,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 36 remaining) [2024-10-13 09:58:00,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (31 of 36 remaining) [2024-10-13 09:58:00,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (30 of 36 remaining) [2024-10-13 09:58:00,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (29 of 36 remaining) [2024-10-13 09:58:00,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (28 of 36 remaining) [2024-10-13 09:58:00,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (27 of 36 remaining) [2024-10-13 09:58:00,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (26 of 36 remaining) [2024-10-13 09:58:00,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (25 of 36 remaining) [2024-10-13 09:58:00,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (24 of 36 remaining) [2024-10-13 09:58:00,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 36 remaining) [2024-10-13 09:58:00,484 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 36 remaining) [2024-10-13 09:58:00,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 36 remaining) [2024-10-13 09:58:00,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (20 of 36 remaining) [2024-10-13 09:58:00,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (19 of 36 remaining) [2024-10-13 09:58:00,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (18 of 36 remaining) [2024-10-13 09:58:00,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (17 of 36 remaining) [2024-10-13 09:58:00,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (16 of 36 remaining) [2024-10-13 09:58:00,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (15 of 36 remaining) [2024-10-13 09:58:00,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (14 of 36 remaining) [2024-10-13 09:58:00,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 36 remaining) [2024-10-13 09:58:00,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 36 remaining) [2024-10-13 09:58:00,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 36 remaining) [2024-10-13 09:58:00,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (10 of 36 remaining) [2024-10-13 09:58:00,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (9 of 36 remaining) [2024-10-13 09:58:00,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (8 of 36 remaining) [2024-10-13 09:58:00,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (7 of 36 remaining) [2024-10-13 09:58:00,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (6 of 36 remaining) [2024-10-13 09:58:00,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (5 of 36 remaining) [2024-10-13 09:58:00,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 36 remaining) [2024-10-13 09:58:00,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (3 of 36 remaining) [2024-10-13 09:58:00,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (2 of 36 remaining) [2024-10-13 09:58:00,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 36 remaining) [2024-10-13 09:58:00,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (0 of 36 remaining) [2024-10-13 09:58:00,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:58:00,486 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:00,494 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 09:58:00,494 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 09:58:00,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:58:00 BasicIcfg [2024-10-13 09:58:00,500 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 09:58:00,501 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 09:58:00,501 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 09:58:00,501 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 09:58:00,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:58" (3/4) ... [2024-10-13 09:58:00,502 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 09:58:00,507 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-13 09:58:00,508 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-13 09:58:00,512 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-13 09:58:00,512 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 09:58:00,512 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 09:58:00,512 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 09:58:00,587 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 09:58:00,587 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 09:58:00,587 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 09:58:00,588 INFO L158 Benchmark]: Toolchain (without parser) took 2961.16ms. Allocated memory was 163.6MB in the beginning and 274.7MB in the end (delta: 111.1MB). Free memory was 92.3MB in the beginning and 243.2MB in the end (delta: -151.0MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. [2024-10-13 09:58:00,588 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:58:00,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.39ms. Allocated memory is still 163.6MB. Free memory was 92.0MB in the beginning and 78.9MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 09:58:00,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.46ms. Allocated memory is still 163.6MB. Free memory was 78.9MB in the beginning and 76.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 09:58:00,589 INFO L158 Benchmark]: Boogie Preprocessor took 17.83ms. Allocated memory is still 163.6MB. Free memory was 76.8MB in the beginning and 75.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:58:00,589 INFO L158 Benchmark]: RCFGBuilder took 493.89ms. Allocated memory is still 163.6MB. Free memory was 75.2MB in the beginning and 130.3MB in the end (delta: -55.0MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2024-10-13 09:58:00,589 INFO L158 Benchmark]: TraceAbstraction took 2088.30ms. Allocated memory is still 228.6MB. Free memory was 197.4MB in the beginning and 69.5MB in the end (delta: 127.9MB). Peak memory consumption was 127.3MB. Max. memory is 16.1GB. [2024-10-13 09:58:00,589 INFO L158 Benchmark]: Witness Printer took 86.88ms. Allocated memory was 228.6MB in the beginning and 274.7MB in the end (delta: 46.1MB). Free memory was 69.5MB in the beginning and 243.2MB in the end (delta: -173.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-10-13 09:58:00,590 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 163.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.39ms. Allocated memory is still 163.6MB. Free memory was 92.0MB in the beginning and 78.9MB in the end (delta: 13.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.46ms. Allocated memory is still 163.6MB. Free memory was 78.9MB in the beginning and 76.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.83ms. Allocated memory is still 163.6MB. Free memory was 76.8MB in the beginning and 75.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 493.89ms. Allocated memory is still 163.6MB. Free memory was 75.2MB in the beginning and 130.3MB in the end (delta: -55.0MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2088.30ms. Allocated memory is still 228.6MB. Free memory was 197.4MB in the beginning and 69.5MB in the end (delta: 127.9MB). Peak memory consumption was 127.3MB. Max. memory is 16.1GB. * Witness Printer took 86.88ms. Allocated memory was 228.6MB in the beginning and 274.7MB in the end (delta: 46.1MB). Free memory was 69.5MB in the beginning and 243.2MB in the end (delta: -173.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 360 locations, 36 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 263 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 295 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 71 mSDtfsCounter, 295 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=496occurred in iteration=10, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 705 NumberOfCodeBlocks, 705 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 693 ConstructedInterpolants, 0 QuantifiedInterpolants, 717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 22 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 09:58:00,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE