./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.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 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:02:30,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:02:30,701 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:02:30,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:02:30,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:02:30,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:02:30,748 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:02:30,748 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:02:30,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:02:30,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:02:30,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:02:30,751 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:02:30,751 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:02:30,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:02:30,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:02:30,752 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:02:30,753 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:02:30,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:02:30,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:02:30,754 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:02:30,754 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:02:30,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:02:30,758 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:02:30,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:02:30,758 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:02:30,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:02:30,759 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:02:30,759 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:02:30,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:02:30,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:02:30,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:02:30,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:02:30,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:02:30,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:02:30,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:02:30,762 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:02:30,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:02:30,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:02:30,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:02:30,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:02:30,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:02:30,764 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 -> 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a [2024-11-09 07:02:31,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:02:31,062 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:02:31,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:02:31,066 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:02:31,066 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:02:31,068 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2024-11-09 07:02:32,609 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:02:32,827 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:02:32,828 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2024-11-09 07:02:32,841 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ba7d44a/d8180e4e8656431faf114223a06297e9/FLAG12ddb496f [2024-11-09 07:02:32,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ba7d44a/d8180e4e8656431faf114223a06297e9 [2024-11-09 07:02:32,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:02:32,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:02:32,872 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:02:32,873 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:02:32,879 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:02:32,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:02:32" (1/1) ... [2024-11-09 07:02:32,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e3f5f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:32, skipping insertion in model container [2024-11-09 07:02:32,881 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:02:32" (1/1) ... [2024-11-09 07:02:32,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:02:33,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:02:33,186 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:02:33,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:02:33,250 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:02:33,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33 WrapperNode [2024-11-09 07:02:33,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:02:33,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:02:33,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:02:33,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:02:33,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,275 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,307 INFO L138 Inliner]: procedures = 24, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-09 07:02:33,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:02:33,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:02:33,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:02:33,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:02:33,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,325 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,326 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,337 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:02:33,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:02:33,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:02:33,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:02:33,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (1/1) ... [2024-11-09 07:02:33,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:02:33,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:02:33,398 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-11-09 07:02:33,401 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-11-09 07:02:33,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:02:33,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 07:02:33,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 07:02:33,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 07:02:33,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 07:02:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 07:02:33,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 07:02:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:02:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:02:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:02:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:02:33,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:02:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:02:33,451 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:02:33,567 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:02:33,570 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:02:34,034 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:02:34,036 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:02:34,060 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:02:34,060 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 07:02:34,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:02:34 BoogieIcfgContainer [2024-11-09 07:02:34,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:02:34,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:02:34,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:02:34,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:02:34,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:02:32" (1/3) ... [2024-11-09 07:02:34,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3e35e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:02:34, skipping insertion in model container [2024-11-09 07:02:34,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:02:33" (2/3) ... [2024-11-09 07:02:34,069 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3e35e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:02:34, skipping insertion in model container [2024-11-09 07:02:34,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:02:34" (3/3) ... [2024-11-09 07:02:34,070 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2024-11-09 07:02:34,086 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:02:34,086 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-11-09 07:02:34,086 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:02:34,207 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 07:02:34,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 268 transitions, 557 flow [2024-11-09 07:02:34,371 INFO L124 PetriNetUnfolderBase]: 13/265 cut-off events. [2024-11-09 07:02:34,371 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 07:02:34,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 265 events. 13/265 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 422 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 201. Up to 2 conditions per place. [2024-11-09 07:02:34,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 265 places, 268 transitions, 557 flow [2024-11-09 07:02:34,390 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 248 transitions, 514 flow [2024-11-09 07:02:34,399 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:02:34,407 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;@332c0ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:02:34,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-09 07:02:34,413 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:02:34,414 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-11-09 07:02:34,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:02:34,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:34,415 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] [2024-11-09 07:02:34,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:34,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:34,424 INFO L85 PathProgramCache]: Analyzing trace with hash 368563286, now seen corresponding path program 1 times [2024-11-09 07:02:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:34,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884575385] [2024-11-09 07:02:34,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:34,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:34,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:34,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884575385] [2024-11-09 07:02:34,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884575385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:34,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:34,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:34,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325292695] [2024-11-09 07:02:34,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:34,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:34,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:34,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:34,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:34,704 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 268 [2024-11-09 07:02:34,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 248 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-11-09 07:02:34,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:34,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 268 [2024-11-09 07:02:34,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:34,861 INFO L124 PetriNetUnfolderBase]: 19/449 cut-off events. [2024-11-09 07:02:34,861 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-09 07:02:34,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 449 events. 19/449 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1605 event pairs, 7 based on Foata normal form. 16/389 useless extension candidates. Maximal degree in co-relation 311. Up to 31 conditions per place. [2024-11-09 07:02:34,873 INFO L140 encePairwiseOnDemand]: 258/268 looper letters, 13 selfloop transitions, 2 changer transitions 3/240 dead transitions. [2024-11-09 07:02:34,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 240 transitions, 528 flow [2024-11-09 07:02:34,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:34,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2024-11-09 07:02:34,897 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.931592039800995 [2024-11-09 07:02:34,900 INFO L175 Difference]: Start difference. First operand has 246 places, 248 transitions, 514 flow. Second operand 3 states and 749 transitions. [2024-11-09 07:02:34,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 240 transitions, 528 flow [2024-11-09 07:02:34,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 240 transitions, 516 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 07:02:34,914 INFO L231 Difference]: Finished difference. Result has 241 places, 237 transitions, 484 flow [2024-11-09 07:02:34,916 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=241, PETRI_TRANSITIONS=237} [2024-11-09 07:02:34,923 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -5 predicate places. [2024-11-09 07:02:34,923 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 237 transitions, 484 flow [2024-11-09 07:02:34,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-11-09 07:02:34,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:34,924 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] [2024-11-09 07:02:34,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:02:34,925 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:34,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:34,927 INFO L85 PathProgramCache]: Analyzing trace with hash -434164009, now seen corresponding path program 1 times [2024-11-09 07:02:34,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:34,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771982239] [2024-11-09 07:02:34,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:34,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:35,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:35,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771982239] [2024-11-09 07:02:35,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771982239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:35,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:35,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:35,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505456887] [2024-11-09 07:02:35,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:35,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:35,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:35,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:35,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:35,065 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 268 [2024-11-09 07:02:35,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 237 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-11-09 07:02:35,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:35,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 268 [2024-11-09 07:02:35,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:35,133 INFO L124 PetriNetUnfolderBase]: 13/339 cut-off events. [2024-11-09 07:02:35,134 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 07:02:35,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 339 events. 13/339 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1039 event pairs, 5 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 346. Up to 27 conditions per place. [2024-11-09 07:02:35,141 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 13 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2024-11-09 07:02:35,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 236 transitions, 512 flow [2024-11-09 07:02:35,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2024-11-09 07:02:35,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9228855721393034 [2024-11-09 07:02:35,145 INFO L175 Difference]: Start difference. First operand has 241 places, 237 transitions, 484 flow. Second operand 3 states and 742 transitions. [2024-11-09 07:02:35,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 236 transitions, 512 flow [2024-11-09 07:02:35,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 236 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:35,153 INFO L231 Difference]: Finished difference. Result has 237 places, 236 transitions, 482 flow [2024-11-09 07:02:35,155 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=237, PETRI_TRANSITIONS=236} [2024-11-09 07:02:35,157 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -9 predicate places. [2024-11-09 07:02:35,157 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 236 transitions, 482 flow [2024-11-09 07:02:35,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-11-09 07:02:35,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:35,158 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-11-09 07:02:35,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:02:35,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:35,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:35,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1401960931, now seen corresponding path program 1 times [2024-11-09 07:02:35,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:35,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811260041] [2024-11-09 07:02:35,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:35,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:35,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:35,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811260041] [2024-11-09 07:02:35,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811260041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:35,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:35,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:35,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000761755] [2024-11-09 07:02:35,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:35,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:35,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:35,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:35,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:35,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 268 [2024-11-09 07:02:35,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 236 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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-11-09 07:02:35,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:35,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 268 [2024-11-09 07:02:35,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:35,395 INFO L124 PetriNetUnfolderBase]: 25/432 cut-off events. [2024-11-09 07:02:35,395 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-09 07:02:35,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 432 events. 25/432 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1674 event pairs, 12 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 452. Up to 46 conditions per place. [2024-11-09 07:02:35,404 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 14 selfloop transitions, 1 changer transitions 0/232 dead transitions. [2024-11-09 07:02:35,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 232 transitions, 504 flow [2024-11-09 07:02:35,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:35,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2024-11-09 07:02:35,408 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9191542288557214 [2024-11-09 07:02:35,408 INFO L175 Difference]: Start difference. First operand has 237 places, 236 transitions, 482 flow. Second operand 3 states and 739 transitions. [2024-11-09 07:02:35,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 232 transitions, 504 flow [2024-11-09 07:02:35,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 232 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:35,413 INFO L231 Difference]: Finished difference. Result has 233 places, 232 transitions, 472 flow [2024-11-09 07:02:35,414 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=233, PETRI_TRANSITIONS=232} [2024-11-09 07:02:35,415 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -13 predicate places. [2024-11-09 07:02:35,416 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 232 transitions, 472 flow [2024-11-09 07:02:35,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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-11-09 07:02:35,417 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:35,417 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:35,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:02:35,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:35,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:35,419 INFO L85 PathProgramCache]: Analyzing trace with hash 73774702, now seen corresponding path program 1 times [2024-11-09 07:02:35,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:35,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16142444] [2024-11-09 07:02:35,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:35,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:36,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:36,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16142444] [2024-11-09 07:02:36,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16142444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:36,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:36,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:36,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081198113] [2024-11-09 07:02:36,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:36,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:02:36,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:36,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:02:36,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:36,303 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 268 [2024-11-09 07:02:36,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 232 transitions, 472 flow. Second operand has 6 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 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-11-09 07:02:36,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:36,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 268 [2024-11-09 07:02:36,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:36,705 INFO L124 PetriNetUnfolderBase]: 394/2180 cut-off events. [2024-11-09 07:02:36,706 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-09 07:02:36,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2799 conditions, 2180 events. 394/2180 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 17733 event pairs, 264 based on Foata normal form. 0/1774 useless extension candidates. Maximal degree in co-relation 2761. Up to 580 conditions per place. [2024-11-09 07:02:36,730 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 26 selfloop transitions, 5 changer transitions 0/231 dead transitions. [2024-11-09 07:02:36,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 231 transitions, 532 flow [2024-11-09 07:02:36,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:02:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:02:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1394 transitions. [2024-11-09 07:02:36,735 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8669154228855721 [2024-11-09 07:02:36,735 INFO L175 Difference]: Start difference. First operand has 233 places, 232 transitions, 472 flow. Second operand 6 states and 1394 transitions. [2024-11-09 07:02:36,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 231 transitions, 532 flow [2024-11-09 07:02:36,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 231 transitions, 531 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:02:36,739 INFO L231 Difference]: Finished difference. Result has 236 places, 231 transitions, 479 flow [2024-11-09 07:02:36,740 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=479, PETRI_PLACES=236, PETRI_TRANSITIONS=231} [2024-11-09 07:02:36,742 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -10 predicate places. [2024-11-09 07:02:36,743 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 231 transitions, 479 flow [2024-11-09 07:02:36,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 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-11-09 07:02:36,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:36,745 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] [2024-11-09 07:02:36,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:02:36,747 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:36,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash -895507990, now seen corresponding path program 1 times [2024-11-09 07:02:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:36,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703436686] [2024-11-09 07:02:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:36,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:36,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:36,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:36,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703436686] [2024-11-09 07:02:36,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703436686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:36,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:36,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:36,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109122266] [2024-11-09 07:02:36,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:36,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:36,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:36,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:36,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:36,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 268 [2024-11-09 07:02:36,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 231 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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-11-09 07:02:36,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:36,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 268 [2024-11-09 07:02:36,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:36,888 INFO L124 PetriNetUnfolderBase]: 24/402 cut-off events. [2024-11-09 07:02:36,888 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 07:02:36,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 402 events. 24/402 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1539 event pairs, 15 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 441. Up to 40 conditions per place. [2024-11-09 07:02:36,893 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 12 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2024-11-09 07:02:36,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 230 transitions, 505 flow [2024-11-09 07:02:36,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:36,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:36,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 744 transitions. [2024-11-09 07:02:36,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9253731343283582 [2024-11-09 07:02:36,896 INFO L175 Difference]: Start difference. First operand has 236 places, 231 transitions, 479 flow. Second operand 3 states and 744 transitions. [2024-11-09 07:02:36,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 230 transitions, 505 flow [2024-11-09 07:02:36,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 230 transitions, 495 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:02:36,901 INFO L231 Difference]: Finished difference. Result has 232 places, 230 transitions, 471 flow [2024-11-09 07:02:36,902 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=232, PETRI_TRANSITIONS=230} [2024-11-09 07:02:36,904 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -14 predicate places. [2024-11-09 07:02:36,905 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 230 transitions, 471 flow [2024-11-09 07:02:36,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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-11-09 07:02:36,906 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:36,907 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:36,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:02:36,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:36,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:36,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1301882729, now seen corresponding path program 1 times [2024-11-09 07:02:36,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:36,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39122779] [2024-11-09 07:02:36,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:36,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:36,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:36,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39122779] [2024-11-09 07:02:36,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39122779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:36,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:36,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809668571] [2024-11-09 07:02:36,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:36,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:36,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:36,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:36,980 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 268 [2024-11-09 07:02:36,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 230 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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-11-09 07:02:36,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:36,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 268 [2024-11-09 07:02:36,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:37,044 INFO L124 PetriNetUnfolderBase]: 37/538 cut-off events. [2024-11-09 07:02:37,046 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-09 07:02:37,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 538 events. 37/538 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2439 event pairs, 20 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 567. Up to 56 conditions per place. [2024-11-09 07:02:37,052 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 14 selfloop transitions, 1 changer transitions 0/226 dead transitions. [2024-11-09 07:02:37,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 226 transitions, 493 flow [2024-11-09 07:02:37,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2024-11-09 07:02:37,055 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9191542288557214 [2024-11-09 07:02:37,055 INFO L175 Difference]: Start difference. First operand has 232 places, 230 transitions, 471 flow. Second operand 3 states and 739 transitions. [2024-11-09 07:02:37,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 226 transitions, 493 flow [2024-11-09 07:02:37,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 226 transitions, 489 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:37,077 INFO L231 Difference]: Finished difference. Result has 228 places, 226 transitions, 461 flow [2024-11-09 07:02:37,078 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=228, PETRI_TRANSITIONS=226} [2024-11-09 07:02:37,079 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -18 predicate places. [2024-11-09 07:02:37,080 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 226 transitions, 461 flow [2024-11-09 07:02:37,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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-11-09 07:02:37,081 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:37,081 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] [2024-11-09 07:02:37,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:02:37,081 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:37,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:37,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1984190935, now seen corresponding path program 1 times [2024-11-09 07:02:37,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:37,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585440762] [2024-11-09 07:02:37,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:37,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:37,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:37,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:37,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585440762] [2024-11-09 07:02:37,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585440762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:37,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:37,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:37,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089170164] [2024-11-09 07:02:37,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:37,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:37,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:37,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:37,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:37,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2024-11-09 07:02:37,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 226 transitions, 461 flow. Second operand has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 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-11-09 07:02:37,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:37,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2024-11-09 07:02:37,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:37,221 INFO L124 PetriNetUnfolderBase]: 14/291 cut-off events. [2024-11-09 07:02:37,222 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 07:02:37,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 291 events. 14/291 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 770 event pairs, 2 based on Foata normal form. 0/266 useless extension candidates. Maximal degree in co-relation 293. Up to 14 conditions per place. [2024-11-09 07:02:37,225 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 10 selfloop transitions, 3 changer transitions 0/226 dead transitions. [2024-11-09 07:02:37,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 226 transitions, 489 flow [2024-11-09 07:02:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-11-09 07:02:37,228 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9365671641791045 [2024-11-09 07:02:37,228 INFO L175 Difference]: Start difference. First operand has 228 places, 226 transitions, 461 flow. Second operand 3 states and 753 transitions. [2024-11-09 07:02:37,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 226 transitions, 489 flow [2024-11-09 07:02:37,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 226 transitions, 488 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:02:37,233 INFO L231 Difference]: Finished difference. Result has 227 places, 224 transitions, 462 flow [2024-11-09 07:02:37,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=227, PETRI_TRANSITIONS=224} [2024-11-09 07:02:37,235 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -19 predicate places. [2024-11-09 07:02:37,235 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 224 transitions, 462 flow [2024-11-09 07:02:37,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 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-11-09 07:02:37,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:37,236 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] [2024-11-09 07:02:37,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:02:37,236 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:37,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash -157970599, now seen corresponding path program 1 times [2024-11-09 07:02:37,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:37,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121471670] [2024-11-09 07:02:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:37,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:37,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:37,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:37,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121471670] [2024-11-09 07:02:37,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121471670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:37,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:37,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:37,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473276008] [2024-11-09 07:02:37,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:37,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:37,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:37,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:37,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:37,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 268 [2024-11-09 07:02:37,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 224 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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-11-09 07:02:37,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:37,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 268 [2024-11-09 07:02:37,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:37,456 INFO L124 PetriNetUnfolderBase]: 114/1110 cut-off events. [2024-11-09 07:02:37,456 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-09 07:02:37,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1309 conditions, 1110 events. 114/1110 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7463 event pairs, 22 based on Foata normal form. 0/965 useless extension candidates. Maximal degree in co-relation 1271. Up to 161 conditions per place. [2024-11-09 07:02:37,469 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 18 selfloop transitions, 3 changer transitions 0/229 dead transitions. [2024-11-09 07:02:37,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 229 transitions, 519 flow [2024-11-09 07:02:37,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-11-09 07:02:37,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9365671641791045 [2024-11-09 07:02:37,472 INFO L175 Difference]: Start difference. First operand has 227 places, 224 transitions, 462 flow. Second operand 3 states and 753 transitions. [2024-11-09 07:02:37,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 229 transitions, 519 flow [2024-11-09 07:02:37,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 229 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:37,477 INFO L231 Difference]: Finished difference. Result has 225 places, 224 transitions, 471 flow [2024-11-09 07:02:37,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=225, PETRI_TRANSITIONS=224} [2024-11-09 07:02:37,478 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -21 predicate places. [2024-11-09 07:02:37,478 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 224 transitions, 471 flow [2024-11-09 07:02:37,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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-11-09 07:02:37,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:37,479 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] [2024-11-09 07:02:37,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:02:37,480 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:37,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash 274364774, now seen corresponding path program 1 times [2024-11-09 07:02:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:37,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019359896] [2024-11-09 07:02:37,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:37,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:37,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:37,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019359896] [2024-11-09 07:02:37,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019359896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:37,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:37,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:37,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635850708] [2024-11-09 07:02:37,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:37,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:37,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:37,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:37,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:37,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2024-11-09 07:02:37,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 224 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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-11-09 07:02:37,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:37,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2024-11-09 07:02:37,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:37,602 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] thread3EXIT-->L87: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][210], [288#(= |#race~M~0| 0), Black: 292#true, 294#(= |#race~A~0| 0), 41#L87true, 276#(= |#race~N~0| 0), 296#true]) [2024-11-09 07:02:37,603 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2024-11-09 07:02:37,603 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2024-11-09 07:02:37,603 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-09 07:02:37,603 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-09 07:02:37,603 INFO L124 PetriNetUnfolderBase]: 53/542 cut-off events. [2024-11-09 07:02:37,604 INFO L125 PetriNetUnfolderBase]: For 17/27 co-relation queries the response was YES. [2024-11-09 07:02:37,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 542 events. 53/542 cut-off events. For 17/27 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2460 event pairs, 4 based on Foata normal form. 1/492 useless extension candidates. Maximal degree in co-relation 628. Up to 41 conditions per place. [2024-11-09 07:02:37,609 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 10 selfloop transitions, 3 changer transitions 0/224 dead transitions. [2024-11-09 07:02:37,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 224 transitions, 499 flow [2024-11-09 07:02:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:37,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-11-09 07:02:37,611 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9365671641791045 [2024-11-09 07:02:37,611 INFO L175 Difference]: Start difference. First operand has 225 places, 224 transitions, 471 flow. Second operand 3 states and 753 transitions. [2024-11-09 07:02:37,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 224 transitions, 499 flow [2024-11-09 07:02:37,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 224 transitions, 499 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:02:37,616 INFO L231 Difference]: Finished difference. Result has 225 places, 222 transitions, 473 flow [2024-11-09 07:02:37,616 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=225, PETRI_TRANSITIONS=222} [2024-11-09 07:02:37,619 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -21 predicate places. [2024-11-09 07:02:37,619 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 222 transitions, 473 flow [2024-11-09 07:02:37,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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-11-09 07:02:37,620 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:37,620 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] [2024-11-09 07:02:37,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:02:37,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:37,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:37,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1430432637, now seen corresponding path program 1 times [2024-11-09 07:02:37,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:37,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954415316] [2024-11-09 07:02:37,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:37,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:37,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:37,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954415316] [2024-11-09 07:02:37,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954415316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:37,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:37,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:02:37,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555748776] [2024-11-09 07:02:37,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:37,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:02:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:37,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:02:37,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:02:37,935 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 268 [2024-11-09 07:02:37,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 222 transitions, 473 flow. Second operand has 7 states, 7 states have (on average 239.85714285714286) internal successors, (1679), 7 states have internal predecessors, (1679), 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-11-09 07:02:37,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:37,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 268 [2024-11-09 07:02:37,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:38,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] thread3EXIT-->L87: Formula: (and (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork0_thidvar0_4) (= v_thread3Thread1of1ForFork0_thidvar3_4 0) (= v_thread3Thread1of1ForFork0_thidvar1_4 0) (= v_thread3Thread1of1ForFork0_thidvar2_4 0)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork0_thidvar3=v_thread3Thread1of1ForFork0_thidvar3_4, thread3Thread1of1ForFork0_thidvar2=v_thread3Thread1of1ForFork0_thidvar2_4, thread3Thread1of1ForFork0_thidvar1=v_thread3Thread1of1ForFork0_thidvar1_4, thread3Thread1of1ForFork0_thidvar0=v_thread3Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][234], [288#(= |#race~M~0| 0), 299#true, Black: 292#true, 294#(= |#race~A~0| 0), 41#L87true, 276#(= |#race~N~0| 0), 296#true]) [2024-11-09 07:02:38,142 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2024-11-09 07:02:38,142 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-11-09 07:02:38,142 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-09 07:02:38,142 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-09 07:02:38,142 INFO L124 PetriNetUnfolderBase]: 56/741 cut-off events. [2024-11-09 07:02:38,142 INFO L125 PetriNetUnfolderBase]: For 9/32 co-relation queries the response was YES. [2024-11-09 07:02:38,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 741 events. 56/741 cut-off events. For 9/32 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3649 event pairs, 18 based on Foata normal form. 5/688 useless extension candidates. Maximal degree in co-relation 884. Up to 62 conditions per place. [2024-11-09 07:02:38,152 INFO L140 encePairwiseOnDemand]: 255/268 looper letters, 22 selfloop transitions, 14 changer transitions 0/237 dead transitions. [2024-11-09 07:02:38,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 237 transitions, 583 flow [2024-11-09 07:02:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:02:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 07:02:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2417 transitions. [2024-11-09 07:02:38,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9018656716417911 [2024-11-09 07:02:38,158 INFO L175 Difference]: Start difference. First operand has 225 places, 222 transitions, 473 flow. Second operand 10 states and 2417 transitions. [2024-11-09 07:02:38,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 237 transitions, 583 flow [2024-11-09 07:02:38,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 237 transitions, 577 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:38,164 INFO L231 Difference]: Finished difference. Result has 236 places, 229 transitions, 533 flow [2024-11-09 07:02:38,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=533, PETRI_PLACES=236, PETRI_TRANSITIONS=229} [2024-11-09 07:02:38,166 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -10 predicate places. [2024-11-09 07:02:38,166 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 229 transitions, 533 flow [2024-11-09 07:02:38,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 239.85714285714286) internal successors, (1679), 7 states have internal predecessors, (1679), 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-11-09 07:02:38,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:38,168 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] [2024-11-09 07:02:38,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:02:38,169 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:38,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:38,169 INFO L85 PathProgramCache]: Analyzing trace with hash -470259363, now seen corresponding path program 1 times [2024-11-09 07:02:38,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:38,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341801746] [2024-11-09 07:02:38,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:38,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:38,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:38,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:38,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341801746] [2024-11-09 07:02:38,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341801746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:38,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:38,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:38,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786952010] [2024-11-09 07:02:38,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:38,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:38,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:38,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:38,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:38,220 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2024-11-09 07:02:38,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 229 transitions, 533 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-11-09 07:02:38,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:38,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2024-11-09 07:02:38,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:38,321 INFO L124 PetriNetUnfolderBase]: 91/737 cut-off events. [2024-11-09 07:02:38,321 INFO L125 PetriNetUnfolderBase]: For 54/65 co-relation queries the response was YES. [2024-11-09 07:02:38,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 965 conditions, 737 events. 91/737 cut-off events. For 54/65 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3740 event pairs, 7 based on Foata normal form. 4/689 useless extension candidates. Maximal degree in co-relation 919. Up to 78 conditions per place. [2024-11-09 07:02:38,330 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 8 selfloop transitions, 2 changer transitions 6/229 dead transitions. [2024-11-09 07:02:38,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 229 transitions, 559 flow [2024-11-09 07:02:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2024-11-09 07:02:38,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9353233830845771 [2024-11-09 07:02:38,332 INFO L175 Difference]: Start difference. First operand has 236 places, 229 transitions, 533 flow. Second operand 3 states and 752 transitions. [2024-11-09 07:02:38,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 229 transitions, 559 flow [2024-11-09 07:02:38,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 229 transitions, 555 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:02:38,337 INFO L231 Difference]: Finished difference. Result has 235 places, 221 transitions, 516 flow [2024-11-09 07:02:38,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=516, PETRI_PLACES=235, PETRI_TRANSITIONS=221} [2024-11-09 07:02:38,338 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -11 predicate places. [2024-11-09 07:02:38,338 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 221 transitions, 516 flow [2024-11-09 07:02:38,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-11-09 07:02:38,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:38,339 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] [2024-11-09 07:02:38,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:02:38,340 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:38,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:38,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1552712436, now seen corresponding path program 1 times [2024-11-09 07:02:38,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:38,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136407863] [2024-11-09 07:02:38,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:38,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:38,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:38,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:38,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:38,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136407863] [2024-11-09 07:02:38,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136407863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:38,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:38,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:38,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42243893] [2024-11-09 07:02:38,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:38,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:02:38,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:38,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:02:38,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:02:38,484 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 268 [2024-11-09 07:02:38,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 221 transitions, 516 flow. Second operand has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-11-09 07:02:38,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:38,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 268 [2024-11-09 07:02:38,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:38,637 INFO L124 PetriNetUnfolderBase]: 94/1147 cut-off events. [2024-11-09 07:02:38,637 INFO L125 PetriNetUnfolderBase]: For 56/65 co-relation queries the response was YES. [2024-11-09 07:02:38,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 1147 events. 94/1147 cut-off events. For 56/65 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7177 event pairs, 35 based on Foata normal form. 8/1071 useless extension candidates. Maximal degree in co-relation 1429. Up to 103 conditions per place. [2024-11-09 07:02:38,653 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 22 selfloop transitions, 5 changer transitions 0/231 dead transitions. [2024-11-09 07:02:38,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 231 transitions, 597 flow [2024-11-09 07:02:38,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:02:38,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 07:02:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1228 transitions. [2024-11-09 07:02:38,656 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9164179104477612 [2024-11-09 07:02:38,656 INFO L175 Difference]: Start difference. First operand has 235 places, 221 transitions, 516 flow. Second operand 5 states and 1228 transitions. [2024-11-09 07:02:38,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 231 transitions, 597 flow [2024-11-09 07:02:38,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 231 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:38,661 INFO L231 Difference]: Finished difference. Result has 233 places, 223 transitions, 537 flow [2024-11-09 07:02:38,662 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=537, PETRI_PLACES=233, PETRI_TRANSITIONS=223} [2024-11-09 07:02:38,662 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -13 predicate places. [2024-11-09 07:02:38,663 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 223 transitions, 537 flow [2024-11-09 07:02:38,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-11-09 07:02:38,664 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:38,664 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] [2024-11-09 07:02:38,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:02:38,664 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:38,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:38,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1491273143, now seen corresponding path program 1 times [2024-11-09 07:02:38,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:38,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71882516] [2024-11-09 07:02:38,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:38,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:39,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:39,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71882516] [2024-11-09 07:02:39,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71882516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:39,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:39,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:39,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252991116] [2024-11-09 07:02:39,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:39,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:02:39,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:39,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:02:39,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:39,227 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 268 [2024-11-09 07:02:39,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 223 transitions, 537 flow. Second operand has 6 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 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-11-09 07:02:39,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:39,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 268 [2024-11-09 07:02:39,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:39,424 INFO L124 PetriNetUnfolderBase]: 111/1171 cut-off events. [2024-11-09 07:02:39,424 INFO L125 PetriNetUnfolderBase]: For 138/147 co-relation queries the response was YES. [2024-11-09 07:02:39,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 1171 events. 111/1171 cut-off events. For 138/147 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7376 event pairs, 32 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 1549. Up to 124 conditions per place. [2024-11-09 07:02:39,443 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 24 selfloop transitions, 5 changer transitions 0/230 dead transitions. [2024-11-09 07:02:39,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 230 transitions, 617 flow [2024-11-09 07:02:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:02:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:02:39,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2024-11-09 07:02:39,448 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9054726368159204 [2024-11-09 07:02:39,448 INFO L175 Difference]: Start difference. First operand has 233 places, 223 transitions, 537 flow. Second operand 6 states and 1456 transitions. [2024-11-09 07:02:39,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 230 transitions, 617 flow [2024-11-09 07:02:39,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 230 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:39,455 INFO L231 Difference]: Finished difference. Result has 235 places, 222 transitions, 540 flow [2024-11-09 07:02:39,456 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=540, PETRI_PLACES=235, PETRI_TRANSITIONS=222} [2024-11-09 07:02:39,457 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -11 predicate places. [2024-11-09 07:02:39,457 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 222 transitions, 540 flow [2024-11-09 07:02:39,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 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-11-09 07:02:39,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:39,460 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-11-09 07:02:39,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:02:39,460 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:39,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:39,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1707714691, now seen corresponding path program 1 times [2024-11-09 07:02:39,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:39,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002613365] [2024-11-09 07:02:39,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:39,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:39,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:39,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002613365] [2024-11-09 07:02:39,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002613365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:39,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:39,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:39,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202449277] [2024-11-09 07:02:39,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:39,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:02:39,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:39,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:02:39,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:40,025 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 268 [2024-11-09 07:02:40,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 222 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 239.83333333333334) internal successors, (1439), 6 states have internal predecessors, (1439), 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-11-09 07:02:40,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:40,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 268 [2024-11-09 07:02:40,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:40,214 INFO L124 PetriNetUnfolderBase]: 181/1135 cut-off events. [2024-11-09 07:02:40,215 INFO L125 PetriNetUnfolderBase]: For 138/203 co-relation queries the response was YES. [2024-11-09 07:02:40,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 1135 events. 181/1135 cut-off events. For 138/203 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7215 event pairs, 44 based on Foata normal form. 8/1072 useless extension candidates. Maximal degree in co-relation 1571. Up to 173 conditions per place. [2024-11-09 07:02:40,235 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 22 selfloop transitions, 5 changer transitions 0/229 dead transitions. [2024-11-09 07:02:40,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 229 transitions, 616 flow [2024-11-09 07:02:40,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:02:40,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:02:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2024-11-09 07:02:40,239 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9054726368159204 [2024-11-09 07:02:40,239 INFO L175 Difference]: Start difference. First operand has 235 places, 222 transitions, 540 flow. Second operand 6 states and 1456 transitions. [2024-11-09 07:02:40,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 229 transitions, 616 flow [2024-11-09 07:02:40,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 229 transitions, 606 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:02:40,244 INFO L231 Difference]: Finished difference. Result has 234 places, 221 transitions, 538 flow [2024-11-09 07:02:40,245 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=234, PETRI_TRANSITIONS=221} [2024-11-09 07:02:40,246 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -12 predicate places. [2024-11-09 07:02:40,246 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 221 transitions, 538 flow [2024-11-09 07:02:40,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.83333333333334) internal successors, (1439), 6 states have internal predecessors, (1439), 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-11-09 07:02:40,247 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:40,247 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:40,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:02:40,247 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:40,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2125255860, now seen corresponding path program 1 times [2024-11-09 07:02:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:40,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62023635] [2024-11-09 07:02:40,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:40,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:40,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:40,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:40,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62023635] [2024-11-09 07:02:40,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62023635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:40,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:40,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:40,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91080596] [2024-11-09 07:02:40,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:40,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:40,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:40,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:40,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:40,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2024-11-09 07:02:40,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 221 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 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-11-09 07:02:40,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:40,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2024-11-09 07:02:40,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:40,453 INFO L124 PetriNetUnfolderBase]: 83/1048 cut-off events. [2024-11-09 07:02:40,454 INFO L125 PetriNetUnfolderBase]: For 46/51 co-relation queries the response was YES. [2024-11-09 07:02:40,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 1048 events. 83/1048 cut-off events. For 46/51 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6147 event pairs, 19 based on Foata normal form. 0/994 useless extension candidates. Maximal degree in co-relation 1338. Up to 86 conditions per place. [2024-11-09 07:02:40,468 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 10 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-11-09 07:02:40,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 222 transitions, 566 flow [2024-11-09 07:02:40,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:40,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-11-09 07:02:40,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9340796019900498 [2024-11-09 07:02:40,470 INFO L175 Difference]: Start difference. First operand has 234 places, 221 transitions, 538 flow. Second operand 3 states and 751 transitions. [2024-11-09 07:02:40,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 222 transitions, 566 flow [2024-11-09 07:02:40,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 222 transitions, 556 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:02:40,476 INFO L231 Difference]: Finished difference. Result has 230 places, 220 transitions, 530 flow [2024-11-09 07:02:40,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=530, PETRI_PLACES=230, PETRI_TRANSITIONS=220} [2024-11-09 07:02:40,477 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -16 predicate places. [2024-11-09 07:02:40,477 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 220 transitions, 530 flow [2024-11-09 07:02:40,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 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-11-09 07:02:40,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:40,478 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:40,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:02:40,479 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:40,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:40,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1992077029, now seen corresponding path program 1 times [2024-11-09 07:02:40,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:40,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317820865] [2024-11-09 07:02:40,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:40,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:40,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:02:40,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:40,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317820865] [2024-11-09 07:02:40,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317820865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:40,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:40,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:02:40,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037714573] [2024-11-09 07:02:40,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:40,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:02:40,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:40,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:02:40,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:02:41,102 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 268 [2024-11-09 07:02:41,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 220 transitions, 530 flow. Second operand has 6 states, 6 states have (on average 240.16666666666666) internal successors, (1441), 6 states have internal predecessors, (1441), 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-11-09 07:02:41,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:41,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 268 [2024-11-09 07:02:41,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:41,284 INFO L124 PetriNetUnfolderBase]: 90/1043 cut-off events. [2024-11-09 07:02:41,284 INFO L125 PetriNetUnfolderBase]: For 76/98 co-relation queries the response was YES. [2024-11-09 07:02:41,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 1043 events. 90/1043 cut-off events. For 76/98 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6307 event pairs, 27 based on Foata normal form. 4/1004 useless extension candidates. Maximal degree in co-relation 1439. Up to 118 conditions per place. [2024-11-09 07:02:41,298 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 24 selfloop transitions, 5 changer transitions 0/227 dead transitions. [2024-11-09 07:02:41,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 227 transitions, 610 flow [2024-11-09 07:02:41,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:02:41,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:02:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2024-11-09 07:02:41,302 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9054726368159204 [2024-11-09 07:02:41,302 INFO L175 Difference]: Start difference. First operand has 230 places, 220 transitions, 530 flow. Second operand 6 states and 1456 transitions. [2024-11-09 07:02:41,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 227 transitions, 610 flow [2024-11-09 07:02:41,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 227 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:02:41,307 INFO L231 Difference]: Finished difference. Result has 232 places, 219 transitions, 534 flow [2024-11-09 07:02:41,308 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=534, PETRI_PLACES=232, PETRI_TRANSITIONS=219} [2024-11-09 07:02:41,308 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -14 predicate places. [2024-11-09 07:02:41,309 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 219 transitions, 534 flow [2024-11-09 07:02:41,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 240.16666666666666) internal successors, (1441), 6 states have internal predecessors, (1441), 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-11-09 07:02:41,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:41,310 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] [2024-11-09 07:02:41,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:02:41,310 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:41,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:41,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1589932602, now seen corresponding path program 1 times [2024-11-09 07:02:41,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:41,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961482372] [2024-11-09 07:02:41,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:41,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:41,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:02:41,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:41,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961482372] [2024-11-09 07:02:41,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961482372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:41,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:41,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:41,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200859749] [2024-11-09 07:02:41,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:41,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:41,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:41,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:41,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:41,367 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2024-11-09 07:02:41,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 219 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-11-09 07:02:41,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:41,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2024-11-09 07:02:41,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:41,511 INFO L124 PetriNetUnfolderBase]: 141/1096 cut-off events. [2024-11-09 07:02:41,511 INFO L125 PetriNetUnfolderBase]: For 99/120 co-relation queries the response was YES. [2024-11-09 07:02:41,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1503 conditions, 1096 events. 141/1096 cut-off events. For 99/120 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6719 event pairs, 40 based on Foata normal form. 0/1044 useless extension candidates. Maximal degree in co-relation 1456. Up to 169 conditions per place. [2024-11-09 07:02:41,521 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 10 selfloop transitions, 2 changer transitions 6/220 dead transitions. [2024-11-09 07:02:41,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 220 transitions, 562 flow [2024-11-09 07:02:41,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-11-09 07:02:41,524 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9340796019900498 [2024-11-09 07:02:41,524 INFO L175 Difference]: Start difference. First operand has 232 places, 219 transitions, 534 flow. Second operand 3 states and 751 transitions. [2024-11-09 07:02:41,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 220 transitions, 562 flow [2024-11-09 07:02:41,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 220 transitions, 552 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:02:41,528 INFO L231 Difference]: Finished difference. Result has 228 places, 212 transitions, 494 flow [2024-11-09 07:02:41,528 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=228, PETRI_TRANSITIONS=212} [2024-11-09 07:02:41,529 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -18 predicate places. [2024-11-09 07:02:41,529 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 212 transitions, 494 flow [2024-11-09 07:02:41,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-11-09 07:02:41,531 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:02:41,532 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] [2024-11-09 07:02:41,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:02:41,532 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2024-11-09 07:02:41,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:02:41,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1518287208, now seen corresponding path program 1 times [2024-11-09 07:02:41,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:02:41,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415145260] [2024-11-09 07:02:41,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:02:41,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:02:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:02:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:02:41,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:02:41,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415145260] [2024-11-09 07:02:41,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415145260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:02:41,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:02:41,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:02:41,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058273799] [2024-11-09 07:02:41,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:02:41,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:02:41,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:02:41,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:02:41,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:02:41,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2024-11-09 07:02:41,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 212 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-11-09 07:02:41,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:02:41,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2024-11-09 07:02:41,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:02:41,719 INFO L124 PetriNetUnfolderBase]: 56/685 cut-off events. [2024-11-09 07:02:41,719 INFO L125 PetriNetUnfolderBase]: For 10/26 co-relation queries the response was YES. [2024-11-09 07:02:41,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 685 events. 56/685 cut-off events. For 10/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3402 event pairs, 17 based on Foata normal form. 2/672 useless extension candidates. Maximal degree in co-relation 865. Up to 58 conditions per place. [2024-11-09 07:02:41,725 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 0 selfloop transitions, 0 changer transitions 213/213 dead transitions. [2024-11-09 07:02:41,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 213 transitions, 522 flow [2024-11-09 07:02:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:02:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:02:41,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-11-09 07:02:41,728 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9340796019900498 [2024-11-09 07:02:41,728 INFO L175 Difference]: Start difference. First operand has 228 places, 212 transitions, 494 flow. Second operand 3 states and 751 transitions. [2024-11-09 07:02:41,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 213 transitions, 522 flow [2024-11-09 07:02:41,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 213 transitions, 498 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-11-09 07:02:41,732 INFO L231 Difference]: Finished difference. Result has 217 places, 0 transitions, 0 flow [2024-11-09 07:02:41,732 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=217, PETRI_TRANSITIONS=0} [2024-11-09 07:02:41,733 INFO L277 CegarLoopForPetriNet]: 246 programPoint places, -29 predicate places. [2024-11-09 07:02:41,733 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 0 transitions, 0 flow [2024-11-09 07:02:41,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-11-09 07:02:41,739 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2024-11-09 07:02:41,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2024-11-09 07:02:41,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2024-11-09 07:02:41,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2024-11-09 07:02:41,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2024-11-09 07:02:41,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2024-11-09 07:02:41,740 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2024-11-09 07:02:41,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2024-11-09 07:02:41,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2024-11-09 07:02:41,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2024-11-09 07:02:41,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2024-11-09 07:02:41,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2024-11-09 07:02:41,741 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2024-11-09 07:02:41,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2024-11-09 07:02:41,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2024-11-09 07:02:41,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2024-11-09 07:02:41,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2024-11-09 07:02:41,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2024-11-09 07:02:41,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2024-11-09 07:02:41,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2024-11-09 07:02:41,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2024-11-09 07:02:41,742 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2024-11-09 07:02:41,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2024-11-09 07:02:41,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2024-11-09 07:02:41,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2024-11-09 07:02:41,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2024-11-09 07:02:41,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2024-11-09 07:02:41,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 46 remaining) [2024-11-09 07:02:41,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 46 remaining) [2024-11-09 07:02:41,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 46 remaining) [2024-11-09 07:02:41,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2024-11-09 07:02:41,743 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2024-11-09 07:02:41,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2024-11-09 07:02:41,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2024-11-09 07:02:41,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2024-11-09 07:02:41,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2024-11-09 07:02:41,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2024-11-09 07:02:41,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2024-11-09 07:02:41,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2024-11-09 07:02:41,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2024-11-09 07:02:41,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2024-11-09 07:02:41,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2024-11-09 07:02:41,744 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2024-11-09 07:02:41,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2024-11-09 07:02:41,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2024-11-09 07:02:41,745 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2024-11-09 07:02:41,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:02:41,746 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:02:41,752 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 07:02:41,752 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:02:41,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:02:41 BasicIcfg [2024-11-09 07:02:41,758 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:02:41,758 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:02:41,758 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:02:41,758 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:02:41,759 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:02:34" (3/4) ... [2024-11-09 07:02:41,760 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:02:41,764 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 07:02:41,764 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 07:02:41,764 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-09 07:02:41,771 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-09 07:02:41,772 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 07:02:41,772 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 07:02:41,772 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:02:41,874 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:02:41,875 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:02:41,875 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:02:41,875 INFO L158 Benchmark]: Toolchain (without parser) took 9006.95ms. Allocated memory was 155.2MB in the beginning and 293.6MB in the end (delta: 138.4MB). Free memory was 100.9MB in the beginning and 214.6MB in the end (delta: -113.8MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2024-11-09 07:02:41,876 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 155.2MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:02:41,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.20ms. Allocated memory is still 155.2MB. Free memory was 100.6MB in the beginning and 85.5MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:02:41,876 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.23ms. Allocated memory is still 155.2MB. Free memory was 85.5MB in the beginning and 83.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:02:41,876 INFO L158 Benchmark]: Boogie Preprocessor took 43.26ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 81.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:02:41,877 INFO L158 Benchmark]: RCFGBuilder took 706.61ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 81.3MB in the beginning and 163.1MB in the end (delta: -81.8MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-11-09 07:02:41,877 INFO L158 Benchmark]: TraceAbstraction took 7693.22ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 162.0MB in the beginning and 220.9MB in the end (delta: -58.9MB). Peak memory consumption was 167.6MB. Max. memory is 16.1GB. [2024-11-09 07:02:41,877 INFO L158 Benchmark]: Witness Printer took 116.69ms. Allocated memory is still 293.6MB. Free memory was 220.9MB in the beginning and 214.6MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:02:41,879 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.26ms. Allocated memory is still 155.2MB. Free memory is still 114.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.20ms. Allocated memory is still 155.2MB. Free memory was 100.6MB in the beginning and 85.5MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.23ms. Allocated memory is still 155.2MB. Free memory was 85.5MB in the beginning and 83.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.26ms. Allocated memory is still 155.2MB. Free memory was 83.4MB in the beginning and 81.7MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 706.61ms. Allocated memory was 155.2MB in the beginning and 201.3MB in the end (delta: 46.1MB). Free memory was 81.3MB in the beginning and 163.1MB in the end (delta: -81.8MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7693.22ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 162.0MB in the beginning and 220.9MB in the end (delta: -58.9MB). Peak memory consumption was 167.6MB. Max. memory is 16.1GB. * Witness Printer took 116.69ms. Allocated memory is still 293.6MB. Free memory was 220.9MB in the beginning and 214.6MB in the end (delta: 6.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: 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: 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: 75]: 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: 77]: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: 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: 89]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 361 locations, 46 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: 7.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 961 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 526 mSDsluCounter, 448 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 328 mSDsCounter, 170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1560 IncrementalHoareTripleChecker+Invalid, 1730 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 170 mSolverCounterUnsat, 120 mSDtfsCounter, 1560 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=13, InterpolantAutomatonStates: 75, 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, 2.4s InterpolantComputationTime, 1540 NumberOfCodeBlocks, 1540 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1522 ConstructedInterpolants, 0 QuantifiedInterpolants, 2228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 2/2 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 27 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:02:41,910 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