./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/popl20-two-queue.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 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/popl20-two-queue.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 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:15:20,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:15:20,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:15:20,406 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:15:20,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:15:20,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:15:20,433 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:15:20,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:15:20,434 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:15:20,435 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:15:20,435 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:15:20,435 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:15:20,436 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:15:20,436 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:15:20,436 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:15:20,437 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:15:20,437 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:15:20,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:15:20,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:15:20,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:15:20,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:15:20,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:15:20,439 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:15:20,439 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:15:20,440 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:15:20,440 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:15:20,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:15:20,441 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:15:20,441 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:15:20,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:15:20,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:15:20,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:15:20,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:15:20,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:15:20,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:15:20,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:15:20,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:15:20,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:15:20,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:15:20,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:15:20,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:15:20,451 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 -> 2b29a4c23931df07495caab7fd70ec22fec28fcea21b47e1c8eb19fb44a778d8 [2024-10-14 17:15:20,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:15:20,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:15:20,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:15:20,739 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:15:20,739 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:15:20,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2024-10-14 17:15:22,182 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:15:22,368 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:15:22,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-two-queue.wvr.c [2024-10-14 17:15:22,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9d21c56/992b769d6b7a4b9ca94af3719004f3b3/FLAGe1dda16ee [2024-10-14 17:15:22,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f9d21c56/992b769d6b7a4b9ca94af3719004f3b3 [2024-10-14 17:15:22,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:15:22,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:15:22,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:15:22,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:15:22,399 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:15:22,400 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:15:22" (1/1) ... [2024-10-14 17:15:22,401 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6610fb5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:22, skipping insertion in model container [2024-10-14 17:15:22,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:15:22" (1/1) ... [2024-10-14 17:15:22,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:15:22,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:15:22,698 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:15:22,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:15:22,763 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:15:22,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:22 WrapperNode [2024-10-14 17:15:22,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:15:22,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:15:22,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:15:22,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:15:22,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:22" (1/1) ... [2024-10-14 17:15:22,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:22" (1/1) ... [2024-10-14 17:15:22,841 INFO L138 Inliner]: procedures = 23, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 410 [2024-10-14 17:15:22,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:15:22,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:15:22,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:15:22,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:15:22,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:22" (1/1) ... [2024-10-14 17:15:22,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:22" (1/1) ... [2024-10-14 17:15:22,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:22" (1/1) ... [2024-10-14 17:15:22,862 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:22" (1/1) ... [2024-10-14 17:15:22,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:22" (1/1) ... [2024-10-14 17:15:22,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:22" (1/1) ... [2024-10-14 17:15:22,897 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:22" (1/1) ... [2024-10-14 17:15:22,899 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:22" (1/1) ... [2024-10-14 17:15:22,903 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:15:22,905 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:15:22,905 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:15:22,905 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:15:22,906 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:22" (1/1) ... [2024-10-14 17:15:22,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:15:22,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:15:22,950 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-14 17:15:22,952 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-14 17:15:23,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:15:23,002 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 17:15:23,003 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 17:15:23,003 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 17:15:23,003 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 17:15:23,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:15:23,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 17:15:23,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 17:15:23,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 17:15:23,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:15:23,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:15:23,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:15:23,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 17:15:23,005 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:15:23,119 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:15:23,121 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:15:23,712 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:15:23,714 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:15:24,132 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:15:24,134 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 17:15:24,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:24 BoogieIcfgContainer [2024-10-14 17:15:24,135 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:15:24,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:15:24,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:15:24,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:15:24,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:15:22" (1/3) ... [2024-10-14 17:15:24,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fcb3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:15:24, skipping insertion in model container [2024-10-14 17:15:24,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:22" (2/3) ... [2024-10-14 17:15:24,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fcb3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:15:24, skipping insertion in model container [2024-10-14 17:15:24,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:24" (3/3) ... [2024-10-14 17:15:24,146 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2024-10-14 17:15:24,165 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:15:24,165 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2024-10-14 17:15:24,165 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:15:24,265 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-14 17:15:24,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 320 places, 326 transitions, 666 flow [2024-10-14 17:15:24,493 INFO L124 PetriNetUnfolderBase]: 13/324 cut-off events. [2024-10-14 17:15:24,494 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 17:15:24,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 324 events. 13/324 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 493 event pairs, 0 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 254. Up to 2 conditions per place. [2024-10-14 17:15:24,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 320 places, 326 transitions, 666 flow [2024-10-14 17:15:24,515 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 302 places, 307 transitions, 626 flow [2024-10-14 17:15:24,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:15:24,538 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;@895099b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:15:24,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 115 error locations. [2024-10-14 17:15:24,546 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:15:24,548 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-10-14 17:15:24,549 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:15:24,549 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:24,550 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] [2024-10-14 17:15:24,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:24,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:24,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1838123497, now seen corresponding path program 1 times [2024-10-14 17:15:24,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:24,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145424937] [2024-10-14 17:15:24,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:24,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:24,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:24,780 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-14 17:15:24,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:24,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145424937] [2024-10-14 17:15:24,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145424937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:24,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:24,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:24,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405098547] [2024-10-14 17:15:24,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:24,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:24,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:24,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:24,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:24,863 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 326 [2024-10-14 17:15:24,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 307 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 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-14 17:15:24,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:24,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 326 [2024-10-14 17:15:24,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:25,015 INFO L124 PetriNetUnfolderBase]: 27/412 cut-off events. [2024-10-14 17:15:25,016 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-10-14 17:15:25,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 412 events. 27/412 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1082 event pairs, 15 based on Foata normal form. 23/373 useless extension candidates. Maximal degree in co-relation 235. Up to 52 conditions per place. [2024-10-14 17:15:25,020 INFO L140 encePairwiseOnDemand]: 275/326 looper letters, 13 selfloop transitions, 2 changer transitions 4/258 dead transitions. [2024-10-14 17:15:25,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 258 transitions, 558 flow [2024-10-14 17:15:25,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 841 transitions. [2024-10-14 17:15:25,044 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8599182004089979 [2024-10-14 17:15:25,046 INFO L175 Difference]: Start difference. First operand has 302 places, 307 transitions, 626 flow. Second operand 3 states and 841 transitions. [2024-10-14 17:15:25,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 258 transitions, 558 flow [2024-10-14 17:15:25,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 258 transitions, 550 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 17:15:25,057 INFO L231 Difference]: Finished difference. Result has 259 places, 254 transitions, 516 flow [2024-10-14 17:15:25,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=259, PETRI_TRANSITIONS=254} [2024-10-14 17:15:25,065 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -43 predicate places. [2024-10-14 17:15:25,066 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 254 transitions, 516 flow [2024-10-14 17:15:25,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 260.3333333333333) internal successors, (781), 3 states have internal predecessors, (781), 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-14 17:15:25,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:25,067 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] [2024-10-14 17:15:25,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:15:25,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:25,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:25,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1538491648, now seen corresponding path program 1 times [2024-10-14 17:15:25,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:25,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140052031] [2024-10-14 17:15:25,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:25,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:25,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:25,150 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-14 17:15:25,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:25,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140052031] [2024-10-14 17:15:25,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140052031] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:25,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:25,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:25,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606811891] [2024-10-14 17:15:25,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:25,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:25,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:25,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:25,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:25,173 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-14 17:15:25,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 254 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-14 17:15:25,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:25,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-14 17:15:25,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:25,247 INFO L124 PetriNetUnfolderBase]: 22/386 cut-off events. [2024-10-14 17:15:25,248 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-14 17:15:25,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 386 events. 22/386 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 860 event pairs, 8 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 399. Up to 38 conditions per place. [2024-10-14 17:15:25,252 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 12 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2024-10-14 17:15:25,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 253 transitions, 542 flow [2024-10-14 17:15:25,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:25,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:25,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2024-10-14 17:15:25,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2024-10-14 17:15:25,257 INFO L175 Difference]: Start difference. First operand has 259 places, 254 transitions, 516 flow. Second operand 3 states and 795 transitions. [2024-10-14 17:15:25,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 253 transitions, 542 flow [2024-10-14 17:15:25,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 253 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:25,283 INFO L231 Difference]: Finished difference. Result has 254 places, 253 transitions, 514 flow [2024-10-14 17:15:25,284 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=254, PETRI_TRANSITIONS=253} [2024-10-14 17:15:25,285 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -48 predicate places. [2024-10-14 17:15:25,285 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 253 transitions, 514 flow [2024-10-14 17:15:25,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-14 17:15:25,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:25,289 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] [2024-10-14 17:15:25,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:15:25,290 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:25,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:25,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1000939298, now seen corresponding path program 1 times [2024-10-14 17:15:25,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:25,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979938395] [2024-10-14 17:15:25,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:25,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:25,344 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-14 17:15:25,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:25,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979938395] [2024-10-14 17:15:25,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979938395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:25,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:25,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:25,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31974915] [2024-10-14 17:15:25,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:25,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:25,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:25,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:25,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:25,367 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-14 17:15:25,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 253 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-14 17:15:25,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:25,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-14 17:15:25,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:25,434 INFO L124 PetriNetUnfolderBase]: 22/385 cut-off events. [2024-10-14 17:15:25,435 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-14 17:15:25,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 385 events. 22/385 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 861 event pairs, 8 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 390. Up to 38 conditions per place. [2024-10-14 17:15:25,437 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 12 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2024-10-14 17:15:25,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 252 transitions, 540 flow [2024-10-14 17:15:25,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:25,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2024-10-14 17:15:25,440 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2024-10-14 17:15:25,441 INFO L175 Difference]: Start difference. First operand has 254 places, 253 transitions, 514 flow. Second operand 3 states and 795 transitions. [2024-10-14 17:15:25,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 252 transitions, 540 flow [2024-10-14 17:15:25,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 252 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:25,445 INFO L231 Difference]: Finished difference. Result has 253 places, 252 transitions, 512 flow [2024-10-14 17:15:25,445 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=253, PETRI_TRANSITIONS=252} [2024-10-14 17:15:25,446 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -49 predicate places. [2024-10-14 17:15:25,446 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 252 transitions, 512 flow [2024-10-14 17:15:25,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-14 17:15:25,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:25,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] [2024-10-14 17:15:25,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:15:25,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:25,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:25,449 INFO L85 PathProgramCache]: Analyzing trace with hash -2004412426, now seen corresponding path program 1 times [2024-10-14 17:15:25,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:25,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053283103] [2024-10-14 17:15:25,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:25,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:25,521 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-14 17:15:25,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:25,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053283103] [2024-10-14 17:15:25,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053283103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:25,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:25,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:25,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786943202] [2024-10-14 17:15:25,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:25,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:25,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:25,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:25,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:25,540 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-14 17:15:25,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 252 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-14 17:15:25,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:25,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-14 17:15:25,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:25,621 INFO L124 PetriNetUnfolderBase]: 22/384 cut-off events. [2024-10-14 17:15:25,621 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-14 17:15:25,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 384 events. 22/384 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 861 event pairs, 8 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 381. Up to 38 conditions per place. [2024-10-14 17:15:25,623 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 12 selfloop transitions, 2 changer transitions 0/251 dead transitions. [2024-10-14 17:15:25,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 251 transitions, 538 flow [2024-10-14 17:15:25,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:25,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:25,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2024-10-14 17:15:25,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2024-10-14 17:15:25,626 INFO L175 Difference]: Start difference. First operand has 253 places, 252 transitions, 512 flow. Second operand 3 states and 795 transitions. [2024-10-14 17:15:25,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 251 transitions, 538 flow [2024-10-14 17:15:25,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 251 transitions, 534 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:25,630 INFO L231 Difference]: Finished difference. Result has 252 places, 251 transitions, 510 flow [2024-10-14 17:15:25,630 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=250, 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=510, PETRI_PLACES=252, PETRI_TRANSITIONS=251} [2024-10-14 17:15:25,631 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -50 predicate places. [2024-10-14 17:15:25,631 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 251 transitions, 510 flow [2024-10-14 17:15:25,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-14 17:15:25,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:25,632 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:25,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:15:25,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:25,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:25,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1088211231, now seen corresponding path program 1 times [2024-10-14 17:15:25,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:25,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394144150] [2024-10-14 17:15:25,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:25,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:25,698 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-14 17:15:25,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:25,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394144150] [2024-10-14 17:15:25,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394144150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:25,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:25,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:25,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936587869] [2024-10-14 17:15:25,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:25,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:25,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:25,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:25,709 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 326 [2024-10-14 17:15:25,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 251 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-14 17:15:25,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:25,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 326 [2024-10-14 17:15:25,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:25,811 INFO L124 PetriNetUnfolderBase]: 23/408 cut-off events. [2024-10-14 17:15:25,811 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-14 17:15:25,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 408 events. 23/408 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1072 event pairs, 5 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 405. Up to 26 conditions per place. [2024-10-14 17:15:25,813 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 16 selfloop transitions, 2 changer transitions 0/257 dead transitions. [2024-10-14 17:15:25,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 257 transitions, 561 flow [2024-10-14 17:15:25,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 811 transitions. [2024-10-14 17:15:25,816 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8292433537832311 [2024-10-14 17:15:25,817 INFO L175 Difference]: Start difference. First operand has 252 places, 251 transitions, 510 flow. Second operand 3 states and 811 transitions. [2024-10-14 17:15:25,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 257 transitions, 561 flow [2024-10-14 17:15:25,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 257 transitions, 557 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:25,822 INFO L231 Difference]: Finished difference. Result has 252 places, 251 transitions, 514 flow [2024-10-14 17:15:25,823 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=252, PETRI_TRANSITIONS=251} [2024-10-14 17:15:25,823 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -50 predicate places. [2024-10-14 17:15:25,824 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 251 transitions, 514 flow [2024-10-14 17:15:25,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-14 17:15:25,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:25,825 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] [2024-10-14 17:15:25,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:15:25,825 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:25,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:25,826 INFO L85 PathProgramCache]: Analyzing trace with hash -2026420870, now seen corresponding path program 1 times [2024-10-14 17:15:25,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:25,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256953904] [2024-10-14 17:15:25,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:25,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:25,892 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-14 17:15:25,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:25,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256953904] [2024-10-14 17:15:25,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256953904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:25,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:25,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:25,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084547373] [2024-10-14 17:15:25,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:25,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:25,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:25,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:25,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:25,912 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 326 [2024-10-14 17:15:25,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 251 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-14 17:15:25,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:25,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 326 [2024-10-14 17:15:25,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:26,002 INFO L124 PetriNetUnfolderBase]: 27/453 cut-off events. [2024-10-14 17:15:26,003 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-14 17:15:26,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 453 events. 27/453 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1200 event pairs, 13 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 266. Up to 51 conditions per place. [2024-10-14 17:15:26,005 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 12 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2024-10-14 17:15:26,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 250 transitions, 540 flow [2024-10-14 17:15:26,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:26,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:26,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-14 17:15:26,009 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-14 17:15:26,009 INFO L175 Difference]: Start difference. First operand has 252 places, 251 transitions, 514 flow. Second operand 3 states and 797 transitions. [2024-10-14 17:15:26,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 250 transitions, 540 flow [2024-10-14 17:15:26,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 250 transitions, 538 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:15:26,014 INFO L231 Difference]: Finished difference. Result has 252 places, 250 transitions, 514 flow [2024-10-14 17:15:26,014 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=250, 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=514, PETRI_PLACES=252, PETRI_TRANSITIONS=250} [2024-10-14 17:15:26,015 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -50 predicate places. [2024-10-14 17:15:26,015 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 250 transitions, 514 flow [2024-10-14 17:15:26,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-14 17:15:26,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:26,016 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] [2024-10-14 17:15:26,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:15:26,017 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:26,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:26,018 INFO L85 PathProgramCache]: Analyzing trace with hash 740504393, now seen corresponding path program 1 times [2024-10-14 17:15:26,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:26,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428035930] [2024-10-14 17:15:26,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:26,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:26,055 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-14 17:15:26,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:26,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428035930] [2024-10-14 17:15:26,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428035930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:26,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:26,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:26,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373343700] [2024-10-14 17:15:26,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:26,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:26,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:26,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:26,071 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-14 17:15:26,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 250 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-14 17:15:26,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:26,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-14 17:15:26,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:26,146 INFO L124 PetriNetUnfolderBase]: 27/452 cut-off events. [2024-10-14 17:15:26,147 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-14 17:15:26,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 452 events. 27/452 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1201 event pairs, 13 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 457. Up to 52 conditions per place. [2024-10-14 17:15:26,149 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 13 selfloop transitions, 2 changer transitions 0/249 dead transitions. [2024-10-14 17:15:26,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 249 transitions, 542 flow [2024-10-14 17:15:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:26,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:26,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2024-10-14 17:15:26,152 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2024-10-14 17:15:26,152 INFO L175 Difference]: Start difference. First operand has 252 places, 250 transitions, 514 flow. Second operand 3 states and 795 transitions. [2024-10-14 17:15:26,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 249 transitions, 542 flow [2024-10-14 17:15:26,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 249 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:26,157 INFO L231 Difference]: Finished difference. Result has 251 places, 249 transitions, 512 flow [2024-10-14 17:15:26,157 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=251, PETRI_TRANSITIONS=249} [2024-10-14 17:15:26,159 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -51 predicate places. [2024-10-14 17:15:26,160 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 249 transitions, 512 flow [2024-10-14 17:15:26,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.3333333333333) internal successors, (784), 3 states have internal predecessors, (784), 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-14 17:15:26,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:26,161 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] [2024-10-14 17:15:26,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:15:26,161 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:26,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:26,162 INFO L85 PathProgramCache]: Analyzing trace with hash 932099919, now seen corresponding path program 1 times [2024-10-14 17:15:26,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:26,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941624359] [2024-10-14 17:15:26,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:26,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:26,212 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-14 17:15:26,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:26,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941624359] [2024-10-14 17:15:26,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941624359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:26,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:26,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:26,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40569931] [2024-10-14 17:15:26,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:26,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:26,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:26,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:26,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:26,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 326 [2024-10-14 17:15:26,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 249 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-14 17:15:26,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:26,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 326 [2024-10-14 17:15:26,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:26,302 INFO L124 PetriNetUnfolderBase]: 31/495 cut-off events. [2024-10-14 17:15:26,302 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-14 17:15:26,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 495 events. 31/495 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1569 event pairs, 8 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 505. Up to 34 conditions per place. [2024-10-14 17:15:26,305 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 17 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2024-10-14 17:15:26,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 255 transitions, 568 flow [2024-10-14 17:15:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 810 transitions. [2024-10-14 17:15:26,307 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8282208588957055 [2024-10-14 17:15:26,308 INFO L175 Difference]: Start difference. First operand has 251 places, 249 transitions, 512 flow. Second operand 3 states and 810 transitions. [2024-10-14 17:15:26,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 255 transitions, 568 flow [2024-10-14 17:15:26,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 255 transitions, 564 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:26,312 INFO L231 Difference]: Finished difference. Result has 251 places, 249 transitions, 516 flow [2024-10-14 17:15:26,312 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=251, PETRI_TRANSITIONS=249} [2024-10-14 17:15:26,313 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -51 predicate places. [2024-10-14 17:15:26,313 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 249 transitions, 516 flow [2024-10-14 17:15:26,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-14 17:15:26,314 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:26,314 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] [2024-10-14 17:15:26,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:15:26,315 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:26,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:26,315 INFO L85 PathProgramCache]: Analyzing trace with hash -639437959, now seen corresponding path program 1 times [2024-10-14 17:15:26,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:26,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595639871] [2024-10-14 17:15:26,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:26,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:26,357 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-14 17:15:26,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:26,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595639871] [2024-10-14 17:15:26,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595639871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:26,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:26,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:26,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251602878] [2024-10-14 17:15:26,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:26,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:26,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:26,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:26,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:26,370 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 326 [2024-10-14 17:15:26,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 249 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-14 17:15:26,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:26,372 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 326 [2024-10-14 17:15:26,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:26,444 INFO L124 PetriNetUnfolderBase]: 31/494 cut-off events. [2024-10-14 17:15:26,444 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-10-14 17:15:26,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 494 events. 31/494 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1573 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 312. Up to 65 conditions per place. [2024-10-14 17:15:26,447 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 13 selfloop transitions, 2 changer transitions 0/248 dead transitions. [2024-10-14 17:15:26,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 248 transitions, 544 flow [2024-10-14 17:15:26,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-14 17:15:26,449 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-14 17:15:26,450 INFO L175 Difference]: Start difference. First operand has 251 places, 249 transitions, 516 flow. Second operand 3 states and 797 transitions. [2024-10-14 17:15:26,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 248 transitions, 544 flow [2024-10-14 17:15:26,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 248 transitions, 542 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:15:26,454 INFO L231 Difference]: Finished difference. Result has 251 places, 248 transitions, 516 flow [2024-10-14 17:15:26,455 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=251, PETRI_TRANSITIONS=248} [2024-10-14 17:15:26,455 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -51 predicate places. [2024-10-14 17:15:26,456 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 248 transitions, 516 flow [2024-10-14 17:15:26,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-14 17:15:26,457 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:26,457 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] [2024-10-14 17:15:26,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:15:26,457 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:26,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:26,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1315042951, now seen corresponding path program 1 times [2024-10-14 17:15:26,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:26,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078047241] [2024-10-14 17:15:26,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:26,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:26,485 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-14 17:15:26,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:26,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078047241] [2024-10-14 17:15:26,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078047241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:26,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:26,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:26,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656959566] [2024-10-14 17:15:26,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:26,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:26,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:26,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:26,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:26,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 326 [2024-10-14 17:15:26,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 248 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-14 17:15:26,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:26,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 326 [2024-10-14 17:15:26,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:26,563 INFO L124 PetriNetUnfolderBase]: 31/493 cut-off events. [2024-10-14 17:15:26,564 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-14 17:15:26,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 493 events. 31/493 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1565 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 508. Up to 63 conditions per place. [2024-10-14 17:15:26,566 INFO L140 encePairwiseOnDemand]: 324/326 looper letters, 12 selfloop transitions, 1 changer transitions 0/247 dead transitions. [2024-10-14 17:15:26,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 247 transitions, 540 flow [2024-10-14 17:15:26,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:26,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2024-10-14 17:15:26,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8220858895705522 [2024-10-14 17:15:26,569 INFO L175 Difference]: Start difference. First operand has 251 places, 248 transitions, 516 flow. Second operand 3 states and 804 transitions. [2024-10-14 17:15:26,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 247 transitions, 540 flow [2024-10-14 17:15:26,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 247 transitions, 536 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:26,574 INFO L231 Difference]: Finished difference. Result has 250 places, 247 transitions, 512 flow [2024-10-14 17:15:26,574 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=250, PETRI_TRANSITIONS=247} [2024-10-14 17:15:26,575 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -52 predicate places. [2024-10-14 17:15:26,575 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 247 transitions, 512 flow [2024-10-14 17:15:26,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-14 17:15:26,576 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:26,576 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] [2024-10-14 17:15:26,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:15:26,576 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:26,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:26,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1481040239, now seen corresponding path program 1 times [2024-10-14 17:15:26,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:26,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158741982] [2024-10-14 17:15:26,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:26,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:27,099 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-14 17:15:27,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:27,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158741982] [2024-10-14 17:15:27,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158741982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:27,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:27,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:15:27,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16672905] [2024-10-14 17:15:27,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:27,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:15:27,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:27,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:15:27,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:15:27,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 326 [2024-10-14 17:15:27,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 247 transitions, 512 flow. Second operand has 6 states, 6 states have (on average 241.5) internal successors, (1449), 6 states have internal predecessors, (1449), 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-14 17:15:27,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:27,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 326 [2024-10-14 17:15:27,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:27,348 INFO L124 PetriNetUnfolderBase]: 31/491 cut-off events. [2024-10-14 17:15:27,348 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-14 17:15:27,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 491 events. 31/491 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1572 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 529. Up to 78 conditions per place. [2024-10-14 17:15:27,351 INFO L140 encePairwiseOnDemand]: 314/326 looper letters, 26 selfloop transitions, 10 changer transitions 0/245 dead transitions. [2024-10-14 17:15:27,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 245 transitions, 580 flow [2024-10-14 17:15:27,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:15:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:15:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1476 transitions. [2024-10-14 17:15:27,356 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.754601226993865 [2024-10-14 17:15:27,356 INFO L175 Difference]: Start difference. First operand has 250 places, 247 transitions, 512 flow. Second operand 6 states and 1476 transitions. [2024-10-14 17:15:27,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 245 transitions, 580 flow [2024-10-14 17:15:27,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 245 transitions, 579 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:15:27,361 INFO L231 Difference]: Finished difference. Result has 252 places, 245 transitions, 527 flow [2024-10-14 17:15:27,362 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=527, PETRI_PLACES=252, PETRI_TRANSITIONS=245} [2024-10-14 17:15:27,363 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -50 predicate places. [2024-10-14 17:15:27,363 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 245 transitions, 527 flow [2024-10-14 17:15:27,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 241.5) internal successors, (1449), 6 states have internal predecessors, (1449), 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-14 17:15:27,364 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:27,364 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] [2024-10-14 17:15:27,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:15:27,366 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:27,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:27,367 INFO L85 PathProgramCache]: Analyzing trace with hash 635319152, now seen corresponding path program 1 times [2024-10-14 17:15:27,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:27,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004359396] [2024-10-14 17:15:27,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:27,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:27,414 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-14 17:15:27,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:27,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004359396] [2024-10-14 17:15:27,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004359396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:27,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:27,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:27,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983114065] [2024-10-14 17:15:27,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:27,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:27,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:27,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:27,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:27,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 326 [2024-10-14 17:15:27,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 245 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-14 17:15:27,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:27,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 326 [2024-10-14 17:15:27,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:27,513 INFO L124 PetriNetUnfolderBase]: 31/490 cut-off events. [2024-10-14 17:15:27,513 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-14 17:15:27,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 601 conditions, 490 events. 31/490 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1557 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 566. Up to 65 conditions per place. [2024-10-14 17:15:27,516 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 13 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2024-10-14 17:15:27,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 244 transitions, 555 flow [2024-10-14 17:15:27,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-14 17:15:27,518 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-14 17:15:27,519 INFO L175 Difference]: Start difference. First operand has 252 places, 245 transitions, 527 flow. Second operand 3 states and 797 transitions. [2024-10-14 17:15:27,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 244 transitions, 555 flow [2024-10-14 17:15:27,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 244 transitions, 535 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:15:27,523 INFO L231 Difference]: Finished difference. Result has 248 places, 244 transitions, 509 flow [2024-10-14 17:15:27,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=246, 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=509, PETRI_PLACES=248, PETRI_TRANSITIONS=244} [2024-10-14 17:15:27,525 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -54 predicate places. [2024-10-14 17:15:27,525 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 244 transitions, 509 flow [2024-10-14 17:15:27,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-14 17:15:27,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:27,526 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] [2024-10-14 17:15:27,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:15:27,527 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:27,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:27,528 INFO L85 PathProgramCache]: Analyzing trace with hash -566549835, now seen corresponding path program 1 times [2024-10-14 17:15:27,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:27,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496722663] [2024-10-14 17:15:27,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:27,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:27,570 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-14 17:15:27,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:27,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496722663] [2024-10-14 17:15:27,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496722663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:27,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798040618] [2024-10-14 17:15:27,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:27,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:27,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:27,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:27,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:27,587 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 326 [2024-10-14 17:15:27,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 244 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-14 17:15:27,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:27,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 326 [2024-10-14 17:15:27,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:27,660 INFO L124 PetriNetUnfolderBase]: 31/489 cut-off events. [2024-10-14 17:15:27,660 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-14 17:15:27,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 489 events. 31/489 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1525 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 505. Up to 63 conditions per place. [2024-10-14 17:15:27,663 INFO L140 encePairwiseOnDemand]: 324/326 looper letters, 12 selfloop transitions, 1 changer transitions 0/243 dead transitions. [2024-10-14 17:15:27,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 243 transitions, 533 flow [2024-10-14 17:15:27,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:27,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:27,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 804 transitions. [2024-10-14 17:15:27,665 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8220858895705522 [2024-10-14 17:15:27,666 INFO L175 Difference]: Start difference. First operand has 248 places, 244 transitions, 509 flow. Second operand 3 states and 804 transitions. [2024-10-14 17:15:27,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 243 transitions, 533 flow [2024-10-14 17:15:27,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 243 transitions, 529 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:27,670 INFO L231 Difference]: Finished difference. Result has 247 places, 243 transitions, 505 flow [2024-10-14 17:15:27,670 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=505, PETRI_PLACES=247, PETRI_TRANSITIONS=243} [2024-10-14 17:15:27,671 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -55 predicate places. [2024-10-14 17:15:27,671 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 243 transitions, 505 flow [2024-10-14 17:15:27,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-14 17:15:27,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:27,673 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:27,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:15:27,673 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:27,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:27,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1422886651, now seen corresponding path program 1 times [2024-10-14 17:15:27,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:27,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000614443] [2024-10-14 17:15:27,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:27,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:27,716 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-14 17:15:27,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:27,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000614443] [2024-10-14 17:15:27,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000614443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:27,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:27,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:27,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466514685] [2024-10-14 17:15:27,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:27,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:27,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:27,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:27,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:27,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 326 [2024-10-14 17:15:27,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 243 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-14 17:15:27,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:27,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 326 [2024-10-14 17:15:27,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:27,801 INFO L124 PetriNetUnfolderBase]: 31/488 cut-off events. [2024-10-14 17:15:27,802 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-14 17:15:27,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 488 events. 31/488 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1521 event pairs, 18 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 505. Up to 65 conditions per place. [2024-10-14 17:15:27,804 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 13 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2024-10-14 17:15:27,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 242 transitions, 533 flow [2024-10-14 17:15:27,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-14 17:15:27,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-14 17:15:27,806 INFO L175 Difference]: Start difference. First operand has 247 places, 243 transitions, 505 flow. Second operand 3 states and 797 transitions. [2024-10-14 17:15:27,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 242 transitions, 533 flow [2024-10-14 17:15:27,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 242 transitions, 532 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:15:27,813 INFO L231 Difference]: Finished difference. Result has 247 places, 242 transitions, 506 flow [2024-10-14 17:15:27,813 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=247, PETRI_TRANSITIONS=242} [2024-10-14 17:15:27,814 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -55 predicate places. [2024-10-14 17:15:27,814 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 242 transitions, 506 flow [2024-10-14 17:15:27,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-14 17:15:27,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:27,815 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, 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-14 17:15:27,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:15:27,816 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:27,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:27,816 INFO L85 PathProgramCache]: Analyzing trace with hash -90226084, now seen corresponding path program 1 times [2024-10-14 17:15:27,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:27,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742692660] [2024-10-14 17:15:27,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:27,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:27,877 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-14 17:15:27,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:27,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742692660] [2024-10-14 17:15:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742692660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:27,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:27,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:27,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332651252] [2024-10-14 17:15:27,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:27,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:27,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:27,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:27,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:27,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 326 [2024-10-14 17:15:27,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 242 transitions, 506 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-14 17:15:27,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:27,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 326 [2024-10-14 17:15:27,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:27,977 INFO L124 PetriNetUnfolderBase]: 66/502 cut-off events. [2024-10-14 17:15:27,977 INFO L125 PetriNetUnfolderBase]: For 32/40 co-relation queries the response was YES. [2024-10-14 17:15:27,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 502 events. 66/502 cut-off events. For 32/40 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1679 event pairs, 8 based on Foata normal form. 2/451 useless extension candidates. Maximal degree in co-relation 616. Up to 108 conditions per place. [2024-10-14 17:15:27,980 INFO L140 encePairwiseOnDemand]: 319/326 looper letters, 16 selfloop transitions, 5 changer transitions 0/243 dead transitions. [2024-10-14 17:15:27,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 243 transitions, 555 flow [2024-10-14 17:15:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 795 transitions. [2024-10-14 17:15:27,983 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8128834355828221 [2024-10-14 17:15:27,983 INFO L175 Difference]: Start difference. First operand has 247 places, 242 transitions, 506 flow. Second operand 3 states and 795 transitions. [2024-10-14 17:15:27,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 243 transitions, 555 flow [2024-10-14 17:15:27,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 243 transitions, 551 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:27,987 INFO L231 Difference]: Finished difference. Result has 244 places, 239 transitions, 506 flow [2024-10-14 17:15:27,988 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=244, PETRI_TRANSITIONS=239} [2024-10-14 17:15:27,989 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -58 predicate places. [2024-10-14 17:15:27,989 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 239 transitions, 506 flow [2024-10-14 17:15:27,989 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-14 17:15:27,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:27,990 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, 1, 1, 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-14 17:15:27,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:15:27,990 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:27,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:27,991 INFO L85 PathProgramCache]: Analyzing trace with hash -807875329, now seen corresponding path program 1 times [2024-10-14 17:15:27,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:27,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986818142] [2024-10-14 17:15:27,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:27,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:28,042 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-14 17:15:28,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:28,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986818142] [2024-10-14 17:15:28,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986818142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:28,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:28,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:28,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095966564] [2024-10-14 17:15:28,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:28,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:28,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:28,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:28,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:28,057 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 261 out of 326 [2024-10-14 17:15:28,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 239 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-14 17:15:28,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:28,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 326 [2024-10-14 17:15:28,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:28,156 INFO L124 PetriNetUnfolderBase]: 91/667 cut-off events. [2024-10-14 17:15:28,157 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-10-14 17:15:28,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 667 events. 91/667 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2738 event pairs, 56 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 848. Up to 179 conditions per place. [2024-10-14 17:15:28,161 INFO L140 encePairwiseOnDemand]: 322/326 looper letters, 16 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2024-10-14 17:15:28,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 240 transitions, 545 flow [2024-10-14 17:15:28,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 801 transitions. [2024-10-14 17:15:28,165 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8190184049079755 [2024-10-14 17:15:28,165 INFO L175 Difference]: Start difference. First operand has 244 places, 239 transitions, 506 flow. Second operand 3 states and 801 transitions. [2024-10-14 17:15:28,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 240 transitions, 545 flow [2024-10-14 17:15:28,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 240 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:28,171 INFO L231 Difference]: Finished difference. Result has 243 places, 239 transitions, 506 flow [2024-10-14 17:15:28,171 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=243, PETRI_TRANSITIONS=239} [2024-10-14 17:15:28,172 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -59 predicate places. [2024-10-14 17:15:28,172 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 239 transitions, 506 flow [2024-10-14 17:15:28,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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-14 17:15:28,173 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:28,173 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, 1, 1, 1, 1, 1, 1, 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-14 17:15:28,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:15:28,174 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:28,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:28,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1859511202, now seen corresponding path program 1 times [2024-10-14 17:15:28,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:28,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890845521] [2024-10-14 17:15:28,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:28,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:28,224 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-14 17:15:28,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:28,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890845521] [2024-10-14 17:15:28,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890845521] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:28,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:28,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:28,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124245088] [2024-10-14 17:15:28,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:28,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:28,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:28,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:28,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:28,241 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 326 [2024-10-14 17:15:28,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 239 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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-14 17:15:28,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:28,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 326 [2024-10-14 17:15:28,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:28,359 INFO L124 PetriNetUnfolderBase]: 81/569 cut-off events. [2024-10-14 17:15:28,359 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-10-14 17:15:28,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 569 events. 81/569 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2105 event pairs, 16 based on Foata normal form. 4/528 useless extension candidates. Maximal degree in co-relation 726. Up to 113 conditions per place. [2024-10-14 17:15:28,363 INFO L140 encePairwiseOnDemand]: 319/326 looper letters, 13 selfloop transitions, 5 changer transitions 4/240 dead transitions. [2024-10-14 17:15:28,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 240 transitions, 553 flow [2024-10-14 17:15:28,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:28,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:28,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 794 transitions. [2024-10-14 17:15:28,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8118609406952966 [2024-10-14 17:15:28,366 INFO L175 Difference]: Start difference. First operand has 243 places, 239 transitions, 506 flow. Second operand 3 states and 794 transitions. [2024-10-14 17:15:28,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 240 transitions, 553 flow [2024-10-14 17:15:28,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 240 transitions, 553 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:15:28,370 INFO L231 Difference]: Finished difference. Result has 242 places, 232 transitions, 501 flow [2024-10-14 17:15:28,370 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=501, PETRI_PLACES=242, PETRI_TRANSITIONS=232} [2024-10-14 17:15:28,371 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -60 predicate places. [2024-10-14 17:15:28,371 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 232 transitions, 501 flow [2024-10-14 17:15:28,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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-14 17:15:28,372 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:28,372 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 17:15:28,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:15:28,372 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:28,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:28,373 INFO L85 PathProgramCache]: Analyzing trace with hash -596019474, now seen corresponding path program 1 times [2024-10-14 17:15:28,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:28,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397780471] [2024-10-14 17:15:28,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:28,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:28,437 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-14 17:15:28,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:28,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397780471] [2024-10-14 17:15:28,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397780471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:28,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:28,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:28,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991285387] [2024-10-14 17:15:28,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:28,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:28,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:28,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:28,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:28,456 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-14 17:15:28,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 232 transitions, 501 flow. Second operand has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 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-14 17:15:28,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:28,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-14 17:15:28,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:28,550 INFO L124 PetriNetUnfolderBase]: 74/624 cut-off events. [2024-10-14 17:15:28,550 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-10-14 17:15:28,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 624 events. 74/624 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2428 event pairs, 41 based on Foata normal form. 0/580 useless extension candidates. Maximal degree in co-relation 835. Up to 116 conditions per place. [2024-10-14 17:15:28,554 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 17 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-10-14 17:15:28,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 235 transitions, 554 flow [2024-10-14 17:15:28,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:28,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-14 17:15:28,556 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-14 17:15:28,556 INFO L175 Difference]: Start difference. First operand has 242 places, 232 transitions, 501 flow. Second operand 3 states and 797 transitions. [2024-10-14 17:15:28,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 235 transitions, 554 flow [2024-10-14 17:15:28,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 235 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:28,562 INFO L231 Difference]: Finished difference. Result has 237 places, 231 transitions, 493 flow [2024-10-14 17:15:28,562 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=237, PETRI_TRANSITIONS=231} [2024-10-14 17:15:28,563 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -65 predicate places. [2024-10-14 17:15:28,563 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 231 transitions, 493 flow [2024-10-14 17:15:28,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 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-14 17:15:28,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:28,564 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 17:15:28,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:15:28,564 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 111 more)] === [2024-10-14 17:15:28,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:28,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1268848396, now seen corresponding path program 1 times [2024-10-14 17:15:28,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:28,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419419856] [2024-10-14 17:15:28,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:28,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:28,619 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-14 17:15:28,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:28,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419419856] [2024-10-14 17:15:28,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419419856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:28,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:28,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:28,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661302914] [2024-10-14 17:15:28,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:28,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:28,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:28,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:28,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:28,637 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 260 out of 326 [2024-10-14 17:15:28,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 231 transitions, 493 flow. Second operand has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 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-14 17:15:28,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:28,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 260 of 326 [2024-10-14 17:15:28,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:28,721 INFO L124 PetriNetUnfolderBase]: 81/538 cut-off events. [2024-10-14 17:15:28,721 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2024-10-14 17:15:28,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 538 events. 81/538 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1975 event pairs, 48 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 692. Up to 129 conditions per place. [2024-10-14 17:15:28,723 INFO L140 encePairwiseOnDemand]: 323/326 looper letters, 0 selfloop transitions, 0 changer transitions 234/234 dead transitions. [2024-10-14 17:15:28,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 234 transitions, 542 flow [2024-10-14 17:15:28,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:28,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:28,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 797 transitions. [2024-10-14 17:15:28,726 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8149284253578732 [2024-10-14 17:15:28,726 INFO L175 Difference]: Start difference. First operand has 237 places, 231 transitions, 493 flow. Second operand 3 states and 797 transitions. [2024-10-14 17:15:28,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 234 transitions, 542 flow [2024-10-14 17:15:28,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 234 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:28,730 INFO L231 Difference]: Finished difference. Result has 236 places, 0 transitions, 0 flow [2024-10-14 17:15:28,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=236, PETRI_TRANSITIONS=0} [2024-10-14 17:15:28,730 INFO L277 CegarLoopForPetriNet]: 302 programPoint places, -66 predicate places. [2024-10-14 17:15:28,731 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 0 transitions, 0 flow [2024-10-14 17:15:28,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.0) internal successors, (789), 3 states have internal predecessors, (789), 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-14 17:15:28,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (114 of 115 remaining) [2024-10-14 17:15:28,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (113 of 115 remaining) [2024-10-14 17:15:28,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (112 of 115 remaining) [2024-10-14 17:15:28,734 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (111 of 115 remaining) [2024-10-14 17:15:28,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (110 of 115 remaining) [2024-10-14 17:15:28,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (109 of 115 remaining) [2024-10-14 17:15:28,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (108 of 115 remaining) [2024-10-14 17:15:28,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (107 of 115 remaining) [2024-10-14 17:15:28,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (106 of 115 remaining) [2024-10-14 17:15:28,735 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (105 of 115 remaining) [2024-10-14 17:15:28,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (104 of 115 remaining) [2024-10-14 17:15:28,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (103 of 115 remaining) [2024-10-14 17:15:28,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (102 of 115 remaining) [2024-10-14 17:15:28,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (101 of 115 remaining) [2024-10-14 17:15:28,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (100 of 115 remaining) [2024-10-14 17:15:28,736 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (99 of 115 remaining) [2024-10-14 17:15:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (98 of 115 remaining) [2024-10-14 17:15:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (97 of 115 remaining) [2024-10-14 17:15:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (96 of 115 remaining) [2024-10-14 17:15:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (95 of 115 remaining) [2024-10-14 17:15:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (94 of 115 remaining) [2024-10-14 17:15:28,737 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (93 of 115 remaining) [2024-10-14 17:15:28,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (92 of 115 remaining) [2024-10-14 17:15:28,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (91 of 115 remaining) [2024-10-14 17:15:28,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (90 of 115 remaining) [2024-10-14 17:15:28,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (89 of 115 remaining) [2024-10-14 17:15:28,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (88 of 115 remaining) [2024-10-14 17:15:28,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (87 of 115 remaining) [2024-10-14 17:15:28,738 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (86 of 115 remaining) [2024-10-14 17:15:28,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (85 of 115 remaining) [2024-10-14 17:15:28,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (84 of 115 remaining) [2024-10-14 17:15:28,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (83 of 115 remaining) [2024-10-14 17:15:28,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (82 of 115 remaining) [2024-10-14 17:15:28,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (81 of 115 remaining) [2024-10-14 17:15:28,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (80 of 115 remaining) [2024-10-14 17:15:28,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (79 of 115 remaining) [2024-10-14 17:15:28,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (78 of 115 remaining) [2024-10-14 17:15:28,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (77 of 115 remaining) [2024-10-14 17:15:28,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (76 of 115 remaining) [2024-10-14 17:15:28,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (75 of 115 remaining) [2024-10-14 17:15:28,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (74 of 115 remaining) [2024-10-14 17:15:28,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (73 of 115 remaining) [2024-10-14 17:15:28,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (72 of 115 remaining) [2024-10-14 17:15:28,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (71 of 115 remaining) [2024-10-14 17:15:28,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (70 of 115 remaining) [2024-10-14 17:15:28,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (69 of 115 remaining) [2024-10-14 17:15:28,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (68 of 115 remaining) [2024-10-14 17:15:28,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (67 of 115 remaining) [2024-10-14 17:15:28,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (66 of 115 remaining) [2024-10-14 17:15:28,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (65 of 115 remaining) [2024-10-14 17:15:28,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (64 of 115 remaining) [2024-10-14 17:15:28,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (63 of 115 remaining) [2024-10-14 17:15:28,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (62 of 115 remaining) [2024-10-14 17:15:28,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (61 of 115 remaining) [2024-10-14 17:15:28,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (60 of 115 remaining) [2024-10-14 17:15:28,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (59 of 115 remaining) [2024-10-14 17:15:28,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (58 of 115 remaining) [2024-10-14 17:15:28,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (57 of 115 remaining) [2024-10-14 17:15:28,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (56 of 115 remaining) [2024-10-14 17:15:28,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (55 of 115 remaining) [2024-10-14 17:15:28,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (54 of 115 remaining) [2024-10-14 17:15:28,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (53 of 115 remaining) [2024-10-14 17:15:28,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (52 of 115 remaining) [2024-10-14 17:15:28,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (51 of 115 remaining) [2024-10-14 17:15:28,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (50 of 115 remaining) [2024-10-14 17:15:28,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 115 remaining) [2024-10-14 17:15:28,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 115 remaining) [2024-10-14 17:15:28,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 115 remaining) [2024-10-14 17:15:28,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (46 of 115 remaining) [2024-10-14 17:15:28,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 115 remaining) [2024-10-14 17:15:28,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 115 remaining) [2024-10-14 17:15:28,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (43 of 115 remaining) [2024-10-14 17:15:28,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (42 of 115 remaining) [2024-10-14 17:15:28,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 115 remaining) [2024-10-14 17:15:28,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (40 of 115 remaining) [2024-10-14 17:15:28,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (39 of 115 remaining) [2024-10-14 17:15:28,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (38 of 115 remaining) [2024-10-14 17:15:28,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (37 of 115 remaining) [2024-10-14 17:15:28,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (36 of 115 remaining) [2024-10-14 17:15:28,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (35 of 115 remaining) [2024-10-14 17:15:28,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 115 remaining) [2024-10-14 17:15:28,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (33 of 115 remaining) [2024-10-14 17:15:28,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (32 of 115 remaining) [2024-10-14 17:15:28,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (31 of 115 remaining) [2024-10-14 17:15:28,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (30 of 115 remaining) [2024-10-14 17:15:28,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (29 of 115 remaining) [2024-10-14 17:15:28,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (28 of 115 remaining) [2024-10-14 17:15:28,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (27 of 115 remaining) [2024-10-14 17:15:28,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (26 of 115 remaining) [2024-10-14 17:15:28,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (25 of 115 remaining) [2024-10-14 17:15:28,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (24 of 115 remaining) [2024-10-14 17:15:28,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 115 remaining) [2024-10-14 17:15:28,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 115 remaining) [2024-10-14 17:15:28,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 115 remaining) [2024-10-14 17:15:28,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (20 of 115 remaining) [2024-10-14 17:15:28,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (19 of 115 remaining) [2024-10-14 17:15:28,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 115 remaining) [2024-10-14 17:15:28,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (17 of 115 remaining) [2024-10-14 17:15:28,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 115 remaining) [2024-10-14 17:15:28,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (15 of 115 remaining) [2024-10-14 17:15:28,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (14 of 115 remaining) [2024-10-14 17:15:28,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (13 of 115 remaining) [2024-10-14 17:15:28,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (12 of 115 remaining) [2024-10-14 17:15:28,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (11 of 115 remaining) [2024-10-14 17:15:28,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (10 of 115 remaining) [2024-10-14 17:15:28,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (9 of 115 remaining) [2024-10-14 17:15:28,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (8 of 115 remaining) [2024-10-14 17:15:28,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (7 of 115 remaining) [2024-10-14 17:15:28,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (6 of 115 remaining) [2024-10-14 17:15:28,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (5 of 115 remaining) [2024-10-14 17:15:28,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (4 of 115 remaining) [2024-10-14 17:15:28,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (3 of 115 remaining) [2024-10-14 17:15:28,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (2 of 115 remaining) [2024-10-14 17:15:28,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (1 of 115 remaining) [2024-10-14 17:15:28,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (0 of 115 remaining) [2024-10-14 17:15:28,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 17:15:28,751 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:28,757 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 17:15:28,757 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:15:28,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:15:28 BasicIcfg [2024-10-14 17:15:28,764 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:15:28,764 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:15:28,764 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:15:28,765 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:15:28,765 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:24" (3/4) ... [2024-10-14 17:15:28,767 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:15:28,770 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-14 17:15:28,770 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-14 17:15:28,782 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-14 17:15:28,782 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 17:15:28,782 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 17:15:28,783 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 17:15:28,882 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:15:28,884 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:15:28,884 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:15:28,885 INFO L158 Benchmark]: Toolchain (without parser) took 6492.88ms. Allocated memory was 134.2MB in the beginning and 308.3MB in the end (delta: 174.1MB). Free memory was 80.2MB in the beginning and 263.2MB in the end (delta: -183.0MB). Peak memory consumption was 170.3MB. Max. memory is 16.1GB. [2024-10-14 17:15:28,885 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 134.2MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:15:28,885 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.55ms. Allocated memory was 134.2MB in the beginning and 176.2MB in the end (delta: 41.9MB). Free memory was 79.8MB in the beginning and 145.7MB in the end (delta: -65.9MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-10-14 17:15:28,885 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.30ms. Allocated memory is still 176.2MB. Free memory was 144.9MB in the beginning and 142.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:15:28,886 INFO L158 Benchmark]: Boogie Preprocessor took 60.44ms. Allocated memory is still 176.2MB. Free memory was 142.1MB in the beginning and 139.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:15:28,886 INFO L158 Benchmark]: RCFGBuilder took 1230.45ms. Allocated memory is still 176.2MB. Free memory was 139.4MB in the beginning and 97.3MB in the end (delta: 42.1MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2024-10-14 17:15:28,886 INFO L158 Benchmark]: TraceAbstraction took 4627.16ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 96.3MB in the beginning and 87.7MB in the end (delta: 8.6MB). Peak memory consumption was 140.2MB. Max. memory is 16.1GB. [2024-10-14 17:15:28,886 INFO L158 Benchmark]: Witness Printer took 119.99ms. Allocated memory is still 308.3MB. Free memory was 87.7MB in the beginning and 263.2MB in the end (delta: -175.6MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2024-10-14 17:15:28,888 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.17ms. Allocated memory is still 134.2MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 370.55ms. Allocated memory was 134.2MB in the beginning and 176.2MB in the end (delta: 41.9MB). Free memory was 79.8MB in the beginning and 145.7MB in the end (delta: -65.9MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.30ms. Allocated memory is still 176.2MB. Free memory was 144.9MB in the beginning and 142.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.44ms. Allocated memory is still 176.2MB. Free memory was 142.1MB in the beginning and 139.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1230.45ms. Allocated memory is still 176.2MB. Free memory was 139.4MB in the beginning and 97.3MB in the end (delta: 42.1MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4627.16ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 96.3MB in the beginning and 87.7MB in the end (delta: 8.6MB). Peak memory consumption was 140.2MB. Max. memory is 16.1GB. * Witness Printer took 119.99ms. Allocated memory is still 308.3MB. Free memory was 87.7MB in the beginning and 263.2MB in the end (delta: -175.6MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: 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: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: 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: 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: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 404 locations, 115 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: 4.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 145 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 622 IncrementalHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 69 mSDtfsCounter, 622 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=626occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1811 NumberOfCodeBlocks, 1811 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1792 ConstructedInterpolants, 0 QuantifiedInterpolants, 1943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 65 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:15:28,914 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