./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/parallel-min-max-1.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/parallel-min-max-1.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 0d8fc97f7c37032d6079f8a24b87bc520ff0a9c17c3894514011566166a643e8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:58:55,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:58:55,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:58:55,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:58:55,993 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:58:56,014 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:58:56,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:58:56,014 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:58:56,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:58:56,015 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:58:56,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:58:56,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:58:56,016 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:58:56,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:58:56,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:58:56,016 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:58:56,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:58:56,017 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:58:56,017 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:58:56,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:58:56,018 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:58:56,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:58:56,020 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:58:56,021 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:58:56,021 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:58:56,021 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:58:56,021 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:58:56,021 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:58:56,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:58:56,022 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:58:56,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:58:56,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:58:56,022 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:58:56,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:58:56,023 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:58:56,023 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:58:56,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:58:56,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:58:56,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:58:56,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:58:56,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:58:56,024 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 -> 0d8fc97f7c37032d6079f8a24b87bc520ff0a9c17c3894514011566166a643e8 [2024-10-13 09:58:56,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:58:56,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:58:56,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:58:56,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:58:56,234 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:58:56,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2024-10-13 09:58:57,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:58:57,642 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:58:57,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-min-max-1.wvr.c [2024-10-13 09:58:57,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd118cf9b/24dc7baba280440ea581747838fd22d1/FLAG30460b39b [2024-10-13 09:58:58,046 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd118cf9b/24dc7baba280440ea581747838fd22d1 [2024-10-13 09:58:58,048 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:58:58,049 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:58:58,050 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:58:58,050 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:58:58,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:58:58,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:58:58" (1/1) ... [2024-10-13 09:58:58,057 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eaccf98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:58, skipping insertion in model container [2024-10-13 09:58:58,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:58:58" (1/1) ... [2024-10-13 09:58:58,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:58:58,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:58:58,287 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:58:58,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:58:58,338 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:58:58,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:58 WrapperNode [2024-10-13 09:58:58,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:58:58,339 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:58:58,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:58:58,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:58:58,344 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:58:58" (1/1) ... [2024-10-13 09:58:58,354 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:58:58" (1/1) ... [2024-10-13 09:58:58,375 INFO L138 Inliner]: procedures = 24, calls = 39, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 192 [2024-10-13 09:58:58,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:58:58,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:58:58,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:58:58,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:58:58,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:58" (1/1) ... [2024-10-13 09:58:58,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:58" (1/1) ... [2024-10-13 09:58:58,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:58" (1/1) ... [2024-10-13 09:58:58,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:58" (1/1) ... [2024-10-13 09:58:58,403 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:58" (1/1) ... [2024-10-13 09:58:58,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:58" (1/1) ... [2024-10-13 09:58:58,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:58" (1/1) ... [2024-10-13 09:58:58,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:58" (1/1) ... [2024-10-13 09:58:58,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:58:58,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:58:58,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:58:58,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:58:58,413 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:58" (1/1) ... [2024-10-13 09:58:58,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:58:58,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:58:58,443 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:58:58,445 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:58:58,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:58:58,481 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:58:58,481 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:58:58,481 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:58:58,482 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:58:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 09:58:58,482 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 09:58:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:58:58,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 09:58:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 09:58:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 09:58:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:58:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:58:58,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:58:58,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 09:58:58,484 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:58:58,581 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:58:58,582 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:58:58,985 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:58:58,985 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:58:59,208 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:58:59,210 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-13 09:58:59,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:58:59 BoogieIcfgContainer [2024-10-13 09:58:59,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:58:59,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:58:59,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:58:59,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:58:59,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:58:58" (1/3) ... [2024-10-13 09:58:59,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37689aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:58:59, skipping insertion in model container [2024-10-13 09:58:59,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:58:58" (2/3) ... [2024-10-13 09:58:59,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37689aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:58:59, skipping insertion in model container [2024-10-13 09:58:59,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:58:59" (3/3) ... [2024-10-13 09:58:59,217 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2024-10-13 09:58:59,253 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:58:59,255 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2024-10-13 09:58:59,255 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:58:59,317 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 09:58:59,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 306 places, 311 transitions, 643 flow [2024-10-13 09:58:59,414 INFO L124 PetriNetUnfolderBase]: 15/308 cut-off events. [2024-10-13 09:58:59,414 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:58:59,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 308 events. 15/308 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 486 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 278. Up to 2 conditions per place. [2024-10-13 09:58:59,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 306 places, 311 transitions, 643 flow [2024-10-13 09:58:59,425 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 287 places, 291 transitions, 600 flow [2024-10-13 09:58:59,435 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:58:59,440 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;@702d9dd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:58:59,441 INFO L334 AbstractCegarLoop]: Starting to check reachability of 82 error locations. [2024-10-13 09:58:59,446 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:58:59,448 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-10-13 09:58:59,448 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:58:59,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:59,449 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] [2024-10-13 09:58:59,449 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:58:59,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:59,453 INFO L85 PathProgramCache]: Analyzing trace with hash 690299377, now seen corresponding path program 1 times [2024-10-13 09:58:59,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:59,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869637022] [2024-10-13 09:58:59,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:59,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:59,596 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:59,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:59,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869637022] [2024-10-13 09:58:59,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869637022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:59,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:59,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280149558] [2024-10-13 09:58:59,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:59,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:59,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:59,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:59,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:59,651 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 311 [2024-10-13 09:58:59,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 291 transitions, 600 flow. Second operand has 3 states, 3 states have (on average 254.33333333333334) internal successors, (763), 3 states have internal predecessors, (763), 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:59,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:59,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 311 [2024-10-13 09:58:59,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:59,821 INFO L124 PetriNetUnfolderBase]: 95/581 cut-off events. [2024-10-13 09:58:59,822 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-10-13 09:58:59,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 581 events. 95/581 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2383 event pairs, 71 based on Foata normal form. 32/529 useless extension candidates. Maximal degree in co-relation 512. Up to 140 conditions per place. [2024-10-13 09:58:59,828 INFO L140 encePairwiseOnDemand]: 274/311 looper letters, 18 selfloop transitions, 2 changer transitions 4/256 dead transitions. [2024-10-13 09:58:59,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 256 transitions, 570 flow [2024-10-13 09:58:59,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:59,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 814 transitions. [2024-10-13 09:58:59,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.872454448017149 [2024-10-13 09:58:59,848 INFO L175 Difference]: Start difference. First operand has 287 places, 291 transitions, 600 flow. Second operand 3 states and 814 transitions. [2024-10-13 09:58:59,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 256 transitions, 570 flow [2024-10-13 09:58:59,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 256 transitions, 558 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 09:58:59,857 INFO L231 Difference]: Finished difference. Result has 255 places, 252 transitions, 514 flow [2024-10-13 09:58:59,858 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=255, PETRI_TRANSITIONS=252} [2024-10-13 09:58:59,861 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -32 predicate places. [2024-10-13 09:58:59,863 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 252 transitions, 514 flow [2024-10-13 09:58:59,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 254.33333333333334) internal successors, (763), 3 states have internal predecessors, (763), 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:59,864 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:59,864 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] [2024-10-13 09:58:59,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:58:59,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:58:59,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:59,866 INFO L85 PathProgramCache]: Analyzing trace with hash -547571996, now seen corresponding path program 1 times [2024-10-13 09:58:59,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:59,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630541818] [2024-10-13 09:58:59,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:59,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:59,930 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:59,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:59,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630541818] [2024-10-13 09:58:59,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630541818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:59,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:59,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:59,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155768359] [2024-10-13 09:58:59,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:59,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:59,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:59,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:59,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:59,948 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 311 [2024-10-13 09:58:59,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 252 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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:59,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:59,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 311 [2024-10-13 09:58:59,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:00,050 INFO L124 PetriNetUnfolderBase]: 95/576 cut-off events. [2024-10-13 09:59:00,050 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:00,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 742 conditions, 576 events. 95/576 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2342 event pairs, 71 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 710. Up to 139 conditions per place. [2024-10-13 09:59:00,055 INFO L140 encePairwiseOnDemand]: 308/311 looper letters, 17 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2024-10-13 09:59:00,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 251 transitions, 550 flow [2024-10-13 09:59:00,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2024-10-13 09:59:00,059 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8381564844587353 [2024-10-13 09:59:00,059 INFO L175 Difference]: Start difference. First operand has 255 places, 252 transitions, 514 flow. Second operand 3 states and 782 transitions. [2024-10-13 09:59:00,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 251 transitions, 550 flow [2024-10-13 09:59:00,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 251 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:00,065 INFO L231 Difference]: Finished difference. Result has 250 places, 251 transitions, 512 flow [2024-10-13 09:59:00,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=250, PETRI_TRANSITIONS=251} [2024-10-13 09:59:00,067 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -37 predicate places. [2024-10-13 09:59:00,067 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 251 transitions, 512 flow [2024-10-13 09:59:00,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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:59:00,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:00,068 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] [2024-10-13 09:59:00,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:59:00,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:59:00,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:00,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1700253594, now seen corresponding path program 1 times [2024-10-13 09:59:00,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:00,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284638542] [2024-10-13 09:59:00,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:00,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:00,127 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:59:00,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:00,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284638542] [2024-10-13 09:59:00,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284638542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:00,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:00,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:00,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430893976] [2024-10-13 09:59:00,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:00,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:00,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:00,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:00,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:00,156 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 311 [2024-10-13 09:59:00,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 251 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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:59:00,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:00,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 311 [2024-10-13 09:59:00,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:00,289 INFO L124 PetriNetUnfolderBase]: 141/662 cut-off events. [2024-10-13 09:59:00,290 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-13 09:59:00,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 662 events. 141/662 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3022 event pairs, 114 based on Foata normal form. 0/579 useless extension candidates. Maximal degree in co-relation 872. Up to 213 conditions per place. [2024-10-13 09:59:00,293 INFO L140 encePairwiseOnDemand]: 308/311 looper letters, 20 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2024-10-13 09:59:00,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 250 transitions, 554 flow [2024-10-13 09:59:00,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:00,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 776 transitions. [2024-10-13 09:59:00,295 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8317256162915327 [2024-10-13 09:59:00,296 INFO L175 Difference]: Start difference. First operand has 250 places, 251 transitions, 512 flow. Second operand 3 states and 776 transitions. [2024-10-13 09:59:00,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 250 transitions, 554 flow [2024-10-13 09:59:00,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 250 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:00,299 INFO L231 Difference]: Finished difference. Result has 249 places, 250 transitions, 510 flow [2024-10-13 09:59:00,299 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=510, PETRI_PLACES=249, PETRI_TRANSITIONS=250} [2024-10-13 09:59:00,300 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -38 predicate places. [2024-10-13 09:59:00,301 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 250 transitions, 510 flow [2024-10-13 09:59:00,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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:59:00,301 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:00,301 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] [2024-10-13 09:59:00,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:59:00,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:59:00,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:00,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1353679398, now seen corresponding path program 1 times [2024-10-13 09:59:00,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:00,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314266010] [2024-10-13 09:59:00,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:00,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:00,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:00,330 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:59:00,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:00,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314266010] [2024-10-13 09:59:00,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314266010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:00,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:00,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:00,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955210537] [2024-10-13 09:59:00,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:00,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:00,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:00,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:00,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:00,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 311 [2024-10-13 09:59:00,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 250 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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:59:00,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:00,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 311 [2024-10-13 09:59:00,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:00,436 INFO L124 PetriNetUnfolderBase]: 197/732 cut-off events. [2024-10-13 09:59:00,437 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-10-13 09:59:00,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 732 events. 197/732 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3519 event pairs, 167 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 1033. Up to 300 conditions per place. [2024-10-13 09:59:00,441 INFO L140 encePairwiseOnDemand]: 306/311 looper letters, 21 selfloop transitions, 1 changer transitions 0/246 dead transitions. [2024-10-13 09:59:00,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 246 transitions, 546 flow [2024-10-13 09:59:00,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2024-10-13 09:59:00,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8285101822079314 [2024-10-13 09:59:00,443 INFO L175 Difference]: Start difference. First operand has 249 places, 250 transitions, 510 flow. Second operand 3 states and 773 transitions. [2024-10-13 09:59:00,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 246 transitions, 546 flow [2024-10-13 09:59:00,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 246 transitions, 542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:00,446 INFO L231 Difference]: Finished difference. Result has 245 places, 246 transitions, 500 flow [2024-10-13 09:59:00,446 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=245, PETRI_TRANSITIONS=246} [2024-10-13 09:59:00,447 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -42 predicate places. [2024-10-13 09:59:00,447 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 246 transitions, 500 flow [2024-10-13 09:59:00,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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:59:00,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:00,448 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] [2024-10-13 09:59:00,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:59:00,448 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:59:00,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:00,449 INFO L85 PathProgramCache]: Analyzing trace with hash -255782570, now seen corresponding path program 1 times [2024-10-13 09:59:00,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:00,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309696149] [2024-10-13 09:59:00,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:00,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:00,493 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:59:00,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:00,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309696149] [2024-10-13 09:59:00,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309696149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:00,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:00,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:00,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001887418] [2024-10-13 09:59:00,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:00,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:00,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:00,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:00,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:00,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 311 [2024-10-13 09:59:00,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 246 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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:59:00,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:00,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 311 [2024-10-13 09:59:00,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:00,569 INFO L124 PetriNetUnfolderBase]: 95/553 cut-off events. [2024-10-13 09:59:00,569 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:00,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 553 events. 95/553 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2221 event pairs, 71 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 670. Up to 139 conditions per place. [2024-10-13 09:59:00,571 INFO L140 encePairwiseOnDemand]: 308/311 looper letters, 17 selfloop transitions, 2 changer transitions 0/245 dead transitions. [2024-10-13 09:59:00,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 245 transitions, 536 flow [2024-10-13 09:59:00,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2024-10-13 09:59:00,573 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8381564844587353 [2024-10-13 09:59:00,573 INFO L175 Difference]: Start difference. First operand has 245 places, 246 transitions, 500 flow. Second operand 3 states and 782 transitions. [2024-10-13 09:59:00,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 245 transitions, 536 flow [2024-10-13 09:59:00,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 245 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:59:00,576 INFO L231 Difference]: Finished difference. Result has 245 places, 245 transitions, 501 flow [2024-10-13 09:59:00,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=245, PETRI_TRANSITIONS=245} [2024-10-13 09:59:00,578 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -42 predicate places. [2024-10-13 09:59:00,579 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 245 transitions, 501 flow [2024-10-13 09:59:00,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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:59:00,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:00,580 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] [2024-10-13 09:59:00,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:59:00,580 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:59:00,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:00,582 INFO L85 PathProgramCache]: Analyzing trace with hash -849528645, now seen corresponding path program 1 times [2024-10-13 09:59:00,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:00,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378636571] [2024-10-13 09:59:00,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:00,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:00,629 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:59:00,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:00,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378636571] [2024-10-13 09:59:00,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378636571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:00,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:00,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:00,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284841892] [2024-10-13 09:59:00,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:00,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:00,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:00,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:00,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:00,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 311 [2024-10-13 09:59:00,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 245 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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:59:00,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:00,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 311 [2024-10-13 09:59:00,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:00,704 INFO L124 PetriNetUnfolderBase]: 95/552 cut-off events. [2024-10-13 09:59:00,704 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:00,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 552 events. 95/552 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2195 event pairs, 71 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 671. Up to 139 conditions per place. [2024-10-13 09:59:00,707 INFO L140 encePairwiseOnDemand]: 308/311 looper letters, 17 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2024-10-13 09:59:00,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 244 transitions, 537 flow [2024-10-13 09:59:00,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2024-10-13 09:59:00,709 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8381564844587353 [2024-10-13 09:59:00,709 INFO L175 Difference]: Start difference. First operand has 245 places, 245 transitions, 501 flow. Second operand 3 states and 782 transitions. [2024-10-13 09:59:00,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 244 transitions, 537 flow [2024-10-13 09:59:00,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 244 transitions, 533 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:00,712 INFO L231 Difference]: Finished difference. Result has 244 places, 244 transitions, 499 flow [2024-10-13 09:59:00,713 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=499, PETRI_PLACES=244, PETRI_TRANSITIONS=244} [2024-10-13 09:59:00,713 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -43 predicate places. [2024-10-13 09:59:00,714 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 244 transitions, 499 flow [2024-10-13 09:59:00,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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:59:00,714 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:00,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:59:00,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:59:00,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1933483101, now seen corresponding path program 1 times [2024-10-13 09:59:00,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:00,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643627028] [2024-10-13 09:59:00,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:00,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:00,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:00,761 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:59:00,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:00,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643627028] [2024-10-13 09:59:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643627028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:00,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:00,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:00,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856138348] [2024-10-13 09:59:00,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:00,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:00,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:00,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:00,781 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 311 [2024-10-13 09:59:00,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 244 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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:59:00,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:00,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 311 [2024-10-13 09:59:00,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:00,836 INFO L124 PetriNetUnfolderBase]: 95/551 cut-off events. [2024-10-13 09:59:00,837 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:00,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 551 events. 95/551 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2200 event pairs, 71 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 673. Up to 142 conditions per place. [2024-10-13 09:59:00,839 INFO L140 encePairwiseOnDemand]: 308/311 looper letters, 20 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2024-10-13 09:59:00,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 243 transitions, 541 flow [2024-10-13 09:59:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:00,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:00,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 776 transitions. [2024-10-13 09:59:00,841 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8317256162915327 [2024-10-13 09:59:00,841 INFO L175 Difference]: Start difference. First operand has 244 places, 244 transitions, 499 flow. Second operand 3 states and 776 transitions. [2024-10-13 09:59:00,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 243 transitions, 541 flow [2024-10-13 09:59:00,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 243 transitions, 537 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:00,844 INFO L231 Difference]: Finished difference. Result has 243 places, 243 transitions, 497 flow [2024-10-13 09:59:00,845 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=493, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=497, PETRI_PLACES=243, PETRI_TRANSITIONS=243} [2024-10-13 09:59:00,845 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -44 predicate places. [2024-10-13 09:59:00,845 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 243 transitions, 497 flow [2024-10-13 09:59:00,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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:59:00,846 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:00,846 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, 1, 1, 1, 1] [2024-10-13 09:59:00,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:59:00,846 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:59:00,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash 208314661, now seen corresponding path program 1 times [2024-10-13 09:59:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:00,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898408901] [2024-10-13 09:59:00,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:00,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:01,233 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:59:01,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:01,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898408901] [2024-10-13 09:59:01,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898408901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:01,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:01,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:59:01,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781221470] [2024-10-13 09:59:01,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:01,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:59:01,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:01,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:59:01,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:59:01,297 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 311 [2024-10-13 09:59:01,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 243 transitions, 497 flow. Second operand has 6 states, 6 states have (on average 245.5) internal successors, (1473), 6 states have internal predecessors, (1473), 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:59:01,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:01,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 311 [2024-10-13 09:59:01,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:01,405 INFO L124 PetriNetUnfolderBase]: 95/550 cut-off events. [2024-10-13 09:59:01,405 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:01,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 550 events. 95/550 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2187 event pairs, 71 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 681. Up to 147 conditions per place. [2024-10-13 09:59:01,408 INFO L140 encePairwiseOnDemand]: 305/311 looper letters, 25 selfloop transitions, 5 changer transitions 0/242 dead transitions. [2024-10-13 09:59:01,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 242 transitions, 555 flow [2024-10-13 09:59:01,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:59:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:59:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1495 transitions. [2024-10-13 09:59:01,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8011789924973205 [2024-10-13 09:59:01,410 INFO L175 Difference]: Start difference. First operand has 243 places, 243 transitions, 497 flow. Second operand 6 states and 1495 transitions. [2024-10-13 09:59:01,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 242 transitions, 555 flow [2024-10-13 09:59:01,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 242 transitions, 551 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:01,413 INFO L231 Difference]: Finished difference. Result has 245 places, 242 transitions, 501 flow [2024-10-13 09:59:01,414 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=501, PETRI_PLACES=245, PETRI_TRANSITIONS=242} [2024-10-13 09:59:01,414 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -42 predicate places. [2024-10-13 09:59:01,414 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 242 transitions, 501 flow [2024-10-13 09:59:01,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.5) internal successors, (1473), 6 states have internal predecessors, (1473), 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:59:01,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:01,417 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, 1, 1, 1, 1] [2024-10-13 09:59:01,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:59:01,417 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:59:01,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:01,417 INFO L85 PathProgramCache]: Analyzing trace with hash -663827835, now seen corresponding path program 1 times [2024-10-13 09:59:01,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:01,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741050015] [2024-10-13 09:59:01,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:01,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:01,459 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:59:01,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:01,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741050015] [2024-10-13 09:59:01,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741050015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:01,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:01,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:01,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048953727] [2024-10-13 09:59:01,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:01,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:01,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:01,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:01,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:01,472 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 311 [2024-10-13 09:59:01,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 242 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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:59:01,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:01,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 311 [2024-10-13 09:59:01,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:01,525 INFO L124 PetriNetUnfolderBase]: 95/549 cut-off events. [2024-10-13 09:59:01,525 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:01,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 719 conditions, 549 events. 95/549 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2192 event pairs, 71 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 701. Up to 139 conditions per place. [2024-10-13 09:59:01,527 INFO L140 encePairwiseOnDemand]: 308/311 looper letters, 17 selfloop transitions, 2 changer transitions 0/241 dead transitions. [2024-10-13 09:59:01,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 241 transitions, 537 flow [2024-10-13 09:59:01,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2024-10-13 09:59:01,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8381564844587353 [2024-10-13 09:59:01,529 INFO L175 Difference]: Start difference. First operand has 245 places, 242 transitions, 501 flow. Second operand 3 states and 782 transitions. [2024-10-13 09:59:01,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 241 transitions, 537 flow [2024-10-13 09:59:01,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 241 transitions, 527 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 09:59:01,532 INFO L231 Difference]: Finished difference. Result has 241 places, 241 transitions, 493 flow [2024-10-13 09:59:01,533 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=241, PETRI_TRANSITIONS=241} [2024-10-13 09:59:01,534 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -46 predicate places. [2024-10-13 09:59:01,534 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 241 transitions, 493 flow [2024-10-13 09:59:01,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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:59:01,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:01,534 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:01,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:59:01,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:59:01,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:01,535 INFO L85 PathProgramCache]: Analyzing trace with hash 415361265, now seen corresponding path program 1 times [2024-10-13 09:59:01,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:01,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951707049] [2024-10-13 09:59:01,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:01,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:01,566 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:59:01,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:01,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951707049] [2024-10-13 09:59:01,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951707049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:01,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:01,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:01,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384669078] [2024-10-13 09:59:01,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:01,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:01,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:01,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:01,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:01,578 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 311 [2024-10-13 09:59:01,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 241 transitions, 493 flow. Second operand has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 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:59:01,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:01,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 311 [2024-10-13 09:59:01,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:01,640 INFO L124 PetriNetUnfolderBase]: 95/558 cut-off events. [2024-10-13 09:59:01,640 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:59:01,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 724 conditions, 558 events. 95/558 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2251 event pairs, 59 based on Foata normal form. 0/507 useless extension candidates. Maximal degree in co-relation 676. Up to 117 conditions per place. [2024-10-13 09:59:01,642 INFO L140 encePairwiseOnDemand]: 307/311 looper letters, 22 selfloop transitions, 2 changer transitions 0/245 dead transitions. [2024-10-13 09:59:01,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 245 transitions, 551 flow [2024-10-13 09:59:01,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:01,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:01,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 791 transitions. [2024-10-13 09:59:01,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8478027867095391 [2024-10-13 09:59:01,644 INFO L175 Difference]: Start difference. First operand has 241 places, 241 transitions, 493 flow. Second operand 3 states and 791 transitions. [2024-10-13 09:59:01,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 245 transitions, 551 flow [2024-10-13 09:59:01,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 245 transitions, 547 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:01,647 INFO L231 Difference]: Finished difference. Result has 239 places, 239 transitions, 489 flow [2024-10-13 09:59:01,648 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=489, PETRI_PLACES=239, PETRI_TRANSITIONS=239} [2024-10-13 09:59:01,649 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -48 predicate places. [2024-10-13 09:59:01,649 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 239 transitions, 489 flow [2024-10-13 09:59:01,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 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:59:01,649 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:01,649 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:01,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:59:01,650 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:59:01,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:01,650 INFO L85 PathProgramCache]: Analyzing trace with hash -269757677, now seen corresponding path program 1 times [2024-10-13 09:59:01,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:01,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294653284] [2024-10-13 09:59:01,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:01,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:01,685 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:59:01,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:01,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294653284] [2024-10-13 09:59:01,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294653284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:01,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:01,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:01,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270842794] [2024-10-13 09:59:01,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:01,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:01,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:01,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:01,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:01,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 311 [2024-10-13 09:59:01,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 239 transitions, 489 flow. Second operand has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 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:59:01,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:01,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 311 [2024-10-13 09:59:01,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:01,756 INFO L124 PetriNetUnfolderBase]: 94/535 cut-off events. [2024-10-13 09:59:01,756 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-10-13 09:59:01,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 535 events. 94/535 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2085 event pairs, 10 based on Foata normal form. 0/492 useless extension candidates. Maximal degree in co-relation 663. Up to 108 conditions per place. [2024-10-13 09:59:01,758 INFO L140 encePairwiseOnDemand]: 308/311 looper letters, 20 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2024-10-13 09:59:01,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 244 transitions, 547 flow [2024-10-13 09:59:01,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-13 09:59:01,760 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8542336548767417 [2024-10-13 09:59:01,760 INFO L175 Difference]: Start difference. First operand has 239 places, 239 transitions, 489 flow. Second operand 3 states and 797 transitions. [2024-10-13 09:59:01,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 244 transitions, 547 flow [2024-10-13 09:59:01,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 244 transitions, 541 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:01,763 INFO L231 Difference]: Finished difference. Result has 238 places, 238 transitions, 487 flow [2024-10-13 09:59:01,763 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=238, PETRI_TRANSITIONS=238} [2024-10-13 09:59:01,763 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -49 predicate places. [2024-10-13 09:59:01,763 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 238 transitions, 487 flow [2024-10-13 09:59:01,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 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:59:01,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:01,764 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:01,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:59:01,766 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:59:01,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:01,766 INFO L85 PathProgramCache]: Analyzing trace with hash 871794877, now seen corresponding path program 1 times [2024-10-13 09:59:01,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:01,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136725426] [2024-10-13 09:59:01,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:01,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:01,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:01,792 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:59:01,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:01,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136725426] [2024-10-13 09:59:01,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136725426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:01,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:01,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:01,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528255903] [2024-10-13 09:59:01,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:01,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:01,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:01,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:01,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:01,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 311 [2024-10-13 09:59:01,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 238 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 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:59:01,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:01,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 311 [2024-10-13 09:59:01,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:01,869 INFO L124 PetriNetUnfolderBase]: 104/630 cut-off events. [2024-10-13 09:59:01,869 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-10-13 09:59:01,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 630 events. 104/630 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2691 event pairs, 57 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 777. Up to 143 conditions per place. [2024-10-13 09:59:01,872 INFO L140 encePairwiseOnDemand]: 307/311 looper letters, 19 selfloop transitions, 3 changer transitions 0/243 dead transitions. [2024-10-13 09:59:01,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 243 transitions, 546 flow [2024-10-13 09:59:01,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:01,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-13 09:59:01,874 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8542336548767417 [2024-10-13 09:59:01,874 INFO L175 Difference]: Start difference. First operand has 238 places, 238 transitions, 487 flow. Second operand 3 states and 797 transitions. [2024-10-13 09:59:01,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 243 transitions, 546 flow [2024-10-13 09:59:01,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 243 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:01,879 INFO L231 Difference]: Finished difference. Result has 238 places, 239 transitions, 498 flow [2024-10-13 09:59:01,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=238, PETRI_TRANSITIONS=239} [2024-10-13 09:59:01,879 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -49 predicate places. [2024-10-13 09:59:01,879 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 239 transitions, 498 flow [2024-10-13 09:59:01,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 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:59:01,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:01,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:01,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:59:01,880 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:59:01,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash 875362131, now seen corresponding path program 1 times [2024-10-13 09:59:01,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:01,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793066488] [2024-10-13 09:59:01,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:01,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:01,904 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:59:01,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:01,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793066488] [2024-10-13 09:59:01,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793066488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:01,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:01,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:01,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796778389] [2024-10-13 09:59:01,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:01,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:01,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:01,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:01,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:01,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 311 [2024-10-13 09:59:01,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 239 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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:59:01,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:01,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 311 [2024-10-13 09:59:01,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:02,046 INFO L124 PetriNetUnfolderBase]: 179/896 cut-off events. [2024-10-13 09:59:02,047 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-10-13 09:59:02,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 896 events. 179/896 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4695 event pairs, 95 based on Foata normal form. 1/820 useless extension candidates. Maximal degree in co-relation 1241. Up to 169 conditions per place. [2024-10-13 09:59:02,050 INFO L140 encePairwiseOnDemand]: 304/311 looper letters, 4 selfloop transitions, 1 changer transitions 94/249 dead transitions. [2024-10-13 09:59:02,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 249 transitions, 607 flow [2024-10-13 09:59:02,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2024-10-13 09:59:02,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8403001071811361 [2024-10-13 09:59:02,051 INFO L175 Difference]: Start difference. First operand has 238 places, 239 transitions, 498 flow. Second operand 3 states and 784 transitions. [2024-10-13 09:59:02,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 249 transitions, 607 flow [2024-10-13 09:59:02,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 249 transitions, 607 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 09:59:02,054 INFO L231 Difference]: Finished difference. Result has 236 places, 155 transitions, 316 flow [2024-10-13 09:59:02,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=236, PETRI_TRANSITIONS=155} [2024-10-13 09:59:02,055 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -51 predicate places. [2024-10-13 09:59:02,056 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 155 transitions, 316 flow [2024-10-13 09:59:02,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.0) internal successors, (750), 3 states have internal predecessors, (750), 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:59:02,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:02,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:02,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:59:02,057 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:59:02,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:02,058 INFO L85 PathProgramCache]: Analyzing trace with hash -590553159, now seen corresponding path program 1 times [2024-10-13 09:59:02,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:02,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389141351] [2024-10-13 09:59:02,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:02,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:02,081 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:59:02,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:02,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389141351] [2024-10-13 09:59:02,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389141351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:02,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:02,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:02,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017308503] [2024-10-13 09:59:02,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:02,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:02,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:02,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:02,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:02,088 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 311 [2024-10-13 09:59:02,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 155 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 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:59:02,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:02,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 311 [2024-10-13 09:59:02,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:02,096 INFO L124 PetriNetUnfolderBase]: 1/166 cut-off events. [2024-10-13 09:59:02,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:59:02,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 166 events. 1/166 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 150. Up to 4 conditions per place. [2024-10-13 09:59:02,097 INFO L140 encePairwiseOnDemand]: 309/311 looper letters, 2 selfloop transitions, 1 changer transitions 0/154 dead transitions. [2024-10-13 09:59:02,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 154 transitions, 320 flow [2024-10-13 09:59:02,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 778 transitions. [2024-10-13 09:59:02,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8338692390139335 [2024-10-13 09:59:02,099 INFO L175 Difference]: Start difference. First operand has 236 places, 155 transitions, 316 flow. Second operand 3 states and 778 transitions. [2024-10-13 09:59:02,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 154 transitions, 320 flow [2024-10-13 09:59:02,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 154 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:59:02,100 INFO L231 Difference]: Finished difference. Result has 159 places, 154 transitions, 314 flow [2024-10-13 09:59:02,101 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=159, PETRI_TRANSITIONS=154} [2024-10-13 09:59:02,101 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -128 predicate places. [2024-10-13 09:59:02,101 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 154 transitions, 314 flow [2024-10-13 09:59:02,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 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:59:02,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59:02,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:59:02,102 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:59:02,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:02,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1796675488, now seen corresponding path program 1 times [2024-10-13 09:59:02,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:02,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145576926] [2024-10-13 09:59:02,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:02,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:02,403 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:59:02,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:02,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145576926] [2024-10-13 09:59:02,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145576926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:02,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:02,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:59:02,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861170639] [2024-10-13 09:59:02,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:02,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:59:02,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:02,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:59:02,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:59:02,437 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 311 [2024-10-13 09:59:02,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 154 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 251.16666666666666) internal successors, (1507), 6 states have internal predecessors, (1507), 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:59:02,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:02,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 311 [2024-10-13 09:59:02,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:02,454 INFO L124 PetriNetUnfolderBase]: 1/165 cut-off events. [2024-10-13 09:59:02,454 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:59:02,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 165 events. 1/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 54 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 165. Up to 7 conditions per place. [2024-10-13 09:59:02,455 INFO L140 encePairwiseOnDemand]: 306/311 looper letters, 7 selfloop transitions, 4 changer transitions 0/153 dead transitions. [2024-10-13 09:59:02,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 153 transitions, 334 flow [2024-10-13 09:59:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:59:02,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:59:02,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1512 transitions. [2024-10-13 09:59:02,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8102893890675241 [2024-10-13 09:59:02,457 INFO L175 Difference]: Start difference. First operand has 159 places, 154 transitions, 314 flow. Second operand 6 states and 1512 transitions. [2024-10-13 09:59:02,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 153 transitions, 334 flow [2024-10-13 09:59:02,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 153 transitions, 333 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:59:02,459 INFO L231 Difference]: Finished difference. Result has 162 places, 153 transitions, 319 flow [2024-10-13 09:59:02,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=319, PETRI_PLACES=162, PETRI_TRANSITIONS=153} [2024-10-13 09:59:02,460 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -125 predicate places. [2024-10-13 09:59:02,460 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 153 transitions, 319 flow [2024-10-13 09:59:02,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.16666666666666) internal successors, (1507), 6 states have internal predecessors, (1507), 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:59:02,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:02,461 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, 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:59:02,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:59:02,461 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 78 more)] === [2024-10-13 09:59:02,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:02,462 INFO L85 PathProgramCache]: Analyzing trace with hash 607081955, now seen corresponding path program 1 times [2024-10-13 09:59:02,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:02,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227138920] [2024-10-13 09:59:02,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:02,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:02,486 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:59:02,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:02,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227138920] [2024-10-13 09:59:02,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227138920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:02,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:02,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:02,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468179276] [2024-10-13 09:59:02,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:02,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:02,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:02,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:02,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:59:02,493 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 311 [2024-10-13 09:59:02,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 153 transitions, 319 flow. Second operand has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 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:59:02,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:59:02,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 311 [2024-10-13 09:59:02,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:59:02,500 INFO L124 PetriNetUnfolderBase]: 1/163 cut-off events. [2024-10-13 09:59:02,500 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:59:02,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 163 events. 1/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 52 event pairs, 0 based on Foata normal form. 2/163 useless extension candidates. Maximal degree in co-relation 153. Up to 2 conditions per place. [2024-10-13 09:59:02,500 INFO L140 encePairwiseOnDemand]: 309/311 looper letters, 0 selfloop transitions, 0 changer transitions 152/152 dead transitions. [2024-10-13 09:59:02,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 152 transitions, 321 flow [2024-10-13 09:59:02,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:59:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:59:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 777 transitions. [2024-10-13 09:59:02,502 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8327974276527331 [2024-10-13 09:59:02,502 INFO L175 Difference]: Start difference. First operand has 162 places, 153 transitions, 319 flow. Second operand 3 states and 777 transitions. [2024-10-13 09:59:02,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 152 transitions, 321 flow [2024-10-13 09:59:02,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 152 transitions, 314 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 09:59:02,503 INFO L231 Difference]: Finished difference. Result has 159 places, 0 transitions, 0 flow [2024-10-13 09:59:02,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=311, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=159, PETRI_TRANSITIONS=0} [2024-10-13 09:59:02,504 INFO L277 CegarLoopForPetriNet]: 287 programPoint places, -128 predicate places. [2024-10-13 09:59:02,504 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 0 transitions, 0 flow [2024-10-13 09:59:02,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.0) internal successors, (777), 3 states have internal predecessors, (777), 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:59:02,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (81 of 82 remaining) [2024-10-13 09:59:02,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (80 of 82 remaining) [2024-10-13 09:59:02,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (79 of 82 remaining) [2024-10-13 09:59:02,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (78 of 82 remaining) [2024-10-13 09:59:02,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (77 of 82 remaining) [2024-10-13 09:59:02,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (76 of 82 remaining) [2024-10-13 09:59:02,507 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (75 of 82 remaining) [2024-10-13 09:59:02,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (74 of 82 remaining) [2024-10-13 09:59:02,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (73 of 82 remaining) [2024-10-13 09:59:02,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (72 of 82 remaining) [2024-10-13 09:59:02,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (71 of 82 remaining) [2024-10-13 09:59:02,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (70 of 82 remaining) [2024-10-13 09:59:02,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (69 of 82 remaining) [2024-10-13 09:59:02,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (68 of 82 remaining) [2024-10-13 09:59:02,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (67 of 82 remaining) [2024-10-13 09:59:02,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (66 of 82 remaining) [2024-10-13 09:59:02,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (65 of 82 remaining) [2024-10-13 09:59:02,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (64 of 82 remaining) [2024-10-13 09:59:02,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (63 of 82 remaining) [2024-10-13 09:59:02,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 82 remaining) [2024-10-13 09:59:02,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (61 of 82 remaining) [2024-10-13 09:59:02,508 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (60 of 82 remaining) [2024-10-13 09:59:02,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (59 of 82 remaining) [2024-10-13 09:59:02,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (58 of 82 remaining) [2024-10-13 09:59:02,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (57 of 82 remaining) [2024-10-13 09:59:02,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (56 of 82 remaining) [2024-10-13 09:59:02,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (55 of 82 remaining) [2024-10-13 09:59:02,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (54 of 82 remaining) [2024-10-13 09:59:02,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (53 of 82 remaining) [2024-10-13 09:59:02,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (52 of 82 remaining) [2024-10-13 09:59:02,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (51 of 82 remaining) [2024-10-13 09:59:02,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (50 of 82 remaining) [2024-10-13 09:59:02,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (49 of 82 remaining) [2024-10-13 09:59:02,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (48 of 82 remaining) [2024-10-13 09:59:02,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (47 of 82 remaining) [2024-10-13 09:59:02,509 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (46 of 82 remaining) [2024-10-13 09:59:02,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (45 of 82 remaining) [2024-10-13 09:59:02,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (44 of 82 remaining) [2024-10-13 09:59:02,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (43 of 82 remaining) [2024-10-13 09:59:02,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (42 of 82 remaining) [2024-10-13 09:59:02,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (41 of 82 remaining) [2024-10-13 09:59:02,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (40 of 82 remaining) [2024-10-13 09:59:02,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (39 of 82 remaining) [2024-10-13 09:59:02,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (38 of 82 remaining) [2024-10-13 09:59:02,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (37 of 82 remaining) [2024-10-13 09:59:02,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (36 of 82 remaining) [2024-10-13 09:59:02,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (35 of 82 remaining) [2024-10-13 09:59:02,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (34 of 82 remaining) [2024-10-13 09:59:02,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (33 of 82 remaining) [2024-10-13 09:59:02,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (32 of 82 remaining) [2024-10-13 09:59:02,510 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 82 remaining) [2024-10-13 09:59:02,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 82 remaining) [2024-10-13 09:59:02,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 82 remaining) [2024-10-13 09:59:02,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 82 remaining) [2024-10-13 09:59:02,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (27 of 82 remaining) [2024-10-13 09:59:02,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 82 remaining) [2024-10-13 09:59:02,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (25 of 82 remaining) [2024-10-13 09:59:02,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 82 remaining) [2024-10-13 09:59:02,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 82 remaining) [2024-10-13 09:59:02,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (22 of 82 remaining) [2024-10-13 09:59:02,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (21 of 82 remaining) [2024-10-13 09:59:02,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (20 of 82 remaining) [2024-10-13 09:59:02,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (19 of 82 remaining) [2024-10-13 09:59:02,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (18 of 82 remaining) [2024-10-13 09:59:02,511 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (17 of 82 remaining) [2024-10-13 09:59:02,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (16 of 82 remaining) [2024-10-13 09:59:02,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (15 of 82 remaining) [2024-10-13 09:59:02,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (14 of 82 remaining) [2024-10-13 09:59:02,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (13 of 82 remaining) [2024-10-13 09:59:02,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (12 of 82 remaining) [2024-10-13 09:59:02,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (11 of 82 remaining) [2024-10-13 09:59:02,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (10 of 82 remaining) [2024-10-13 09:59:02,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 82 remaining) [2024-10-13 09:59:02,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (8 of 82 remaining) [2024-10-13 09:59:02,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (7 of 82 remaining) [2024-10-13 09:59:02,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (6 of 82 remaining) [2024-10-13 09:59:02,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (5 of 82 remaining) [2024-10-13 09:59:02,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (4 of 82 remaining) [2024-10-13 09:59:02,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (3 of 82 remaining) [2024-10-13 09:59:02,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 82 remaining) [2024-10-13 09:59:02,513 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (1 of 82 remaining) [2024-10-13 09:59:02,513 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (0 of 82 remaining) [2024-10-13 09:59:02,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:59:02,513 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:59:02,518 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 09:59:02,518 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 09:59:02,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:59:02 BasicIcfg [2024-10-13 09:59:02,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 09:59:02,523 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 09:59:02,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 09:59:02,523 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 09:59:02,523 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:58:59" (3/4) ... [2024-10-13 09:59:02,524 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 09:59:02,526 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-13 09:59:02,526 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-13 09:59:02,526 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-13 09:59:02,531 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-13 09:59:02,532 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 09:59:02,532 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 09:59:02,533 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 09:59:02,612 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 09:59:02,612 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 09:59:02,612 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 09:59:02,613 INFO L158 Benchmark]: Toolchain (without parser) took 4563.60ms. Allocated memory was 161.5MB in the beginning and 293.6MB in the end (delta: 132.1MB). Free memory was 105.4MB in the beginning and 114.3MB in the end (delta: -8.9MB). Peak memory consumption was 122.1MB. Max. memory is 16.1GB. [2024-10-13 09:59:02,613 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 50.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:59:02,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.21ms. Allocated memory is still 161.5MB. Free memory was 104.9MB in the beginning and 127.4MB in the end (delta: -22.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 09:59:02,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.15ms. Allocated memory is still 161.5MB. Free memory was 127.4MB in the beginning and 125.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 09:59:02,613 INFO L158 Benchmark]: Boogie Preprocessor took 36.55ms. Allocated memory is still 161.5MB. Free memory was 125.4MB in the beginning and 122.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 09:59:02,613 INFO L158 Benchmark]: RCFGBuilder took 797.79ms. Allocated memory is still 161.5MB. Free memory was 122.5MB in the beginning and 124.9MB in the end (delta: -2.4MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. [2024-10-13 09:59:02,614 INFO L158 Benchmark]: TraceAbstraction took 3310.89ms. Allocated memory was 161.5MB in the beginning and 293.6MB in the end (delta: 132.1MB). Free memory was 124.9MB in the beginning and 121.6MB in the end (delta: 3.3MB). Peak memory consumption was 136.4MB. Max. memory is 16.1GB. [2024-10-13 09:59:02,614 INFO L158 Benchmark]: Witness Printer took 89.56ms. Allocated memory is still 293.6MB. Free memory was 121.6MB in the beginning and 114.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 09:59:02,615 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.14ms. Allocated memory is still 96.5MB. Free memory is still 50.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.21ms. Allocated memory is still 161.5MB. Free memory was 104.9MB in the beginning and 127.4MB in the end (delta: -22.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.15ms. Allocated memory is still 161.5MB. Free memory was 127.4MB in the beginning and 125.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.55ms. Allocated memory is still 161.5MB. Free memory was 125.4MB in the beginning and 122.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 797.79ms. Allocated memory is still 161.5MB. Free memory was 122.5MB in the beginning and 124.9MB in the end (delta: -2.4MB). Peak memory consumption was 74.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3310.89ms. Allocated memory was 161.5MB in the beginning and 293.6MB in the end (delta: 132.1MB). Free memory was 124.9MB in the beginning and 121.6MB in the end (delta: 3.3MB). Peak memory consumption was 136.4MB. Max. memory is 16.1GB. * Witness Printer took 89.56ms. Allocated memory is still 293.6MB. Free memory was 121.6MB in the beginning and 114.3MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 364 locations, 82 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: 3.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 356 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 152 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 652 IncrementalHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 64 mSDtfsCounter, 652 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=600occurred in iteration=0, InterpolantAutomatonStates: 54, 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, 1.0s InterpolantComputationTime, 1372 NumberOfCodeBlocks, 1372 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1356 ConstructedInterpolants, 0 QuantifiedInterpolants, 1580 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 50 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 09:59:02,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE