./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 8be7027f 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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:39:55,789 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:39:55,870 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:39:55,876 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:39:55,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:39:55,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:39:55,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:39:55,904 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:39:55,904 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:39:55,905 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:39:55,905 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:39:55,906 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:39:55,906 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:39:55,906 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:39:55,907 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:39:55,907 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:39:55,908 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:39:55,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:39:55,908 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:39:55,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:39:55,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:39:55,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:39:55,912 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:39:55,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:39:55,913 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:39:55,913 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:39:55,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:39:55,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:39:55,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:39:55,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:39:55,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:39:55,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:39:55,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:39:55,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:39:55,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:39:55,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:39:55,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:39:55,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:39:55,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:39:55,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:39:55,918 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:39:55,918 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-12 12:39:56,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:39:56,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:39:56,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:39:56,209 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:39:56,211 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:39:56,213 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-12 12:39:57,648 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:39:57,838 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:39:57,838 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2024-11-12 12:39:57,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a7ff6fe/af15485394734b90b5d8ddba95f1fb95/FLAG1d2fe1dc4 [2024-11-12 12:39:58,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05a7ff6fe/af15485394734b90b5d8ddba95f1fb95 [2024-11-12 12:39:58,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:39:58,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:39:58,225 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:39:58,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:39:58,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:39:58,231 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9ac08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58, skipping insertion in model container [2024-11-12 12:39:58,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:39:58,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:39:58,500 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:39:58,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:39:58,554 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:39:58,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58 WrapperNode [2024-11-12 12:39:58,556 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:39:58,557 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:39:58,558 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:39:58,558 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:39:58,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,623 INFO L138 Inliner]: procedures = 24, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-11-12 12:39:58,626 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:39:58,627 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:39:58,627 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:39:58,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:39:58,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,670 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:39:58,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:39:58,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:39:58,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:39:58,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (1/1) ... [2024-11-12 12:39:58,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:39:58,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:39:58,736 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-12 12:39:58,738 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-12 12:39:58,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:39:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 12:39:58,783 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 12:39:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 12:39:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 12:39:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-12 12:39:58,784 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-12 12:39:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:39:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:39:58,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:39:58,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:39:58,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:39:58,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:39:58,787 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:39:58,891 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:39:58,893 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:39:59,305 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:39:59,305 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:39:59,331 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:39:59,333 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-12 12:39:59,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:39:59 BoogieIcfgContainer [2024-11-12 12:39:59,334 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:39:59,337 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:39:59,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:39:59,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:39:59,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:39:58" (1/3) ... [2024-11-12 12:39:59,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f300eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:39:59, skipping insertion in model container [2024-11-12 12:39:59,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:58" (2/3) ... [2024-11-12 12:39:59,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f300eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:39:59, skipping insertion in model container [2024-11-12 12:39:59,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:39:59" (3/3) ... [2024-11-12 12:39:59,346 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2024-11-12 12:39:59,361 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:39:59,361 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-11-12 12:39:59,361 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:39:59,473 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-12 12:39:59,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 268 transitions, 557 flow [2024-11-12 12:39:59,647 INFO L124 PetriNetUnfolderBase]: 13/265 cut-off events. [2024-11-12 12:39:59,648 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-12 12:39:59,659 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-12 12:39:59,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 265 places, 268 transitions, 557 flow [2024-11-12 12:39:59,668 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 248 transitions, 514 flow [2024-11-12 12:39:59,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:39:59,693 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;@407960b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:39:59,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-12 12:39:59,699 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:39:59,699 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-11-12 12:39:59,699 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:39:59,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:59,700 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:39:59,702 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-12 12:39:59,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:59,707 INFO L85 PathProgramCache]: Analyzing trace with hash 368563286, now seen corresponding path program 1 times [2024-11-12 12:39:59,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:59,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979739216] [2024-11-12 12:39:59,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:59,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:59,926 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-12 12:39:59,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:59,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979739216] [2024-11-12 12:39:59,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979739216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:59,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:59,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:59,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222501825] [2024-11-12 12:39:59,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:59,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:59,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:59,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:59,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:00,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 268 [2024-11-12 12:40:00,023 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-12 12:40:00,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:00,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 268 [2024-11-12 12:40:00,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:00,155 INFO L124 PetriNetUnfolderBase]: 19/449 cut-off events. [2024-11-12 12:40:00,158 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-12 12:40:00,161 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-12 12:40:00,167 INFO L140 encePairwiseOnDemand]: 258/268 looper letters, 13 selfloop transitions, 2 changer transitions 3/240 dead transitions. [2024-11-12 12:40:00,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 240 transitions, 528 flow [2024-11-12 12:40:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2024-11-12 12:40:00,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.931592039800995 [2024-11-12 12:40:00,190 INFO L175 Difference]: Start difference. First operand has 246 places, 248 transitions, 514 flow. Second operand 3 states and 749 transitions. [2024-11-12 12:40:00,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 240 transitions, 528 flow [2024-11-12 12:40:00,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 240 transitions, 516 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-12 12:40:00,204 INFO L231 Difference]: Finished difference. Result has 241 places, 237 transitions, 484 flow [2024-11-12 12:40:00,207 INFO L262 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-12 12:40:00,213 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -5 predicate places. [2024-11-12 12:40:00,214 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 237 transitions, 484 flow [2024-11-12 12:40:00,215 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-12 12:40:00,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:00,215 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:00,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:40:00,216 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-12 12:40:00,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:00,218 INFO L85 PathProgramCache]: Analyzing trace with hash -434164009, now seen corresponding path program 1 times [2024-11-12 12:40:00,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:00,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931473511] [2024-11-12 12:40:00,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:00,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:00,303 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-12 12:40:00,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:00,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931473511] [2024-11-12 12:40:00,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931473511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:00,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:00,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:00,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217503155] [2024-11-12 12:40:00,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:00,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:00,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:00,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:00,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:00,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 268 [2024-11-12 12:40:00,341 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-12 12:40:00,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:00,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 268 [2024-11-12 12:40:00,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:00,403 INFO L124 PetriNetUnfolderBase]: 13/339 cut-off events. [2024-11-12 12:40:00,403 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 12:40:00,408 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-12 12:40:00,433 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 13 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2024-11-12 12:40:00,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 236 transitions, 512 flow [2024-11-12 12:40:00,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:00,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:00,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2024-11-12 12:40:00,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228855721393034 [2024-11-12 12:40:00,437 INFO L175 Difference]: Start difference. First operand has 241 places, 237 transitions, 484 flow. Second operand 3 states and 742 transitions. [2024-11-12 12:40:00,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 236 transitions, 512 flow [2024-11-12 12:40:00,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 236 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:00,447 INFO L231 Difference]: Finished difference. Result has 237 places, 236 transitions, 482 flow [2024-11-12 12:40:00,450 INFO L262 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-12 12:40:00,450 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -9 predicate places. [2024-11-12 12:40:00,451 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 236 transitions, 482 flow [2024-11-12 12:40:00,451 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-12 12:40:00,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:00,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:00,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:40:00,453 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-12 12:40:00,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:00,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1401960931, now seen corresponding path program 1 times [2024-11-12 12:40:00,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:00,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070888900] [2024-11-12 12:40:00,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:00,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:00,527 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-12 12:40:00,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:00,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070888900] [2024-11-12 12:40:00,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070888900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:00,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:00,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:00,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437047624] [2024-11-12 12:40:00,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:00,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:00,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:00,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:00,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:00,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 268 [2024-11-12 12:40:00,562 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-12 12:40:00,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:00,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 268 [2024-11-12 12:40:00,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:00,659 INFO L124 PetriNetUnfolderBase]: 25/432 cut-off events. [2024-11-12 12:40:00,659 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-12 12:40:00,663 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-12 12:40:00,666 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 14 selfloop transitions, 1 changer transitions 0/232 dead transitions. [2024-11-12 12:40:00,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 232 transitions, 504 flow [2024-11-12 12:40:00,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:00,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:00,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2024-11-12 12:40:00,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191542288557214 [2024-11-12 12:40:00,669 INFO L175 Difference]: Start difference. First operand has 237 places, 236 transitions, 482 flow. Second operand 3 states and 739 transitions. [2024-11-12 12:40:00,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 232 transitions, 504 flow [2024-11-12 12:40:00,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 232 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:00,675 INFO L231 Difference]: Finished difference. Result has 233 places, 232 transitions, 472 flow [2024-11-12 12:40:00,676 INFO L262 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-12 12:40:00,677 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -13 predicate places. [2024-11-12 12:40:00,678 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 232 transitions, 472 flow [2024-11-12 12:40:00,678 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-12 12:40:00,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:00,679 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:00,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:40:00,679 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-12 12:40:00,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:00,681 INFO L85 PathProgramCache]: Analyzing trace with hash 73774702, now seen corresponding path program 1 times [2024-11-12 12:40:00,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:00,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994515932] [2024-11-12 12:40:00,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:00,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:01,378 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-12 12:40:01,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:01,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994515932] [2024-11-12 12:40:01,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994515932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:01,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:01,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:01,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976339197] [2024-11-12 12:40:01,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:01,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:01,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:01,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:01,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:01,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 268 [2024-11-12 12:40:01,550 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-12 12:40:01,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:01,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 268 [2024-11-12 12:40:01,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:01,918 INFO L124 PetriNetUnfolderBase]: 394/2180 cut-off events. [2024-11-12 12:40:01,918 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-12 12:40:01,928 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-12 12:40:01,942 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 26 selfloop transitions, 5 changer transitions 0/231 dead transitions. [2024-11-12 12:40:01,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 231 transitions, 532 flow [2024-11-12 12:40:01,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:01,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1394 transitions. [2024-11-12 12:40:01,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8669154228855721 [2024-11-12 12:40:01,947 INFO L175 Difference]: Start difference. First operand has 233 places, 232 transitions, 472 flow. Second operand 6 states and 1394 transitions. [2024-11-12 12:40:01,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 231 transitions, 532 flow [2024-11-12 12:40:01,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 231 transitions, 531 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:01,951 INFO L231 Difference]: Finished difference. Result has 236 places, 231 transitions, 479 flow [2024-11-12 12:40:01,952 INFO L262 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-12 12:40:01,954 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -10 predicate places. [2024-11-12 12:40:01,955 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 231 transitions, 479 flow [2024-11-12 12:40:01,956 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-12 12:40:01,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:01,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:01,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:40:01,957 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-12 12:40:01,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:01,957 INFO L85 PathProgramCache]: Analyzing trace with hash -895507990, now seen corresponding path program 1 times [2024-11-12 12:40:01,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:01,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270963391] [2024-11-12 12:40:01,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:01,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:02,012 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-12 12:40:02,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:02,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270963391] [2024-11-12 12:40:02,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270963391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:02,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:02,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:02,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197940219] [2024-11-12 12:40:02,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:02,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:02,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:02,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:02,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:02,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 268 [2024-11-12 12:40:02,041 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-12 12:40:02,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:02,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 268 [2024-11-12 12:40:02,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:02,099 INFO L124 PetriNetUnfolderBase]: 24/402 cut-off events. [2024-11-12 12:40:02,099 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 12:40:02,101 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-12 12:40:02,103 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 12 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2024-11-12 12:40:02,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 230 transitions, 505 flow [2024-11-12 12:40:02,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 744 transitions. [2024-11-12 12:40:02,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9253731343283582 [2024-11-12 12:40:02,106 INFO L175 Difference]: Start difference. First operand has 236 places, 231 transitions, 479 flow. Second operand 3 states and 744 transitions. [2024-11-12 12:40:02,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 230 transitions, 505 flow [2024-11-12 12:40:02,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 230 transitions, 495 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:40:02,110 INFO L231 Difference]: Finished difference. Result has 232 places, 230 transitions, 471 flow [2024-11-12 12:40:02,110 INFO L262 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-12 12:40:02,113 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -14 predicate places. [2024-11-12 12:40:02,113 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 230 transitions, 471 flow [2024-11-12 12:40:02,114 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-12 12:40:02,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:02,114 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:02,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:40:02,114 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-12 12:40:02,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:02,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1301882729, now seen corresponding path program 1 times [2024-11-12 12:40:02,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:02,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233814907] [2024-11-12 12:40:02,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:02,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:02,149 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-12 12:40:02,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:02,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233814907] [2024-11-12 12:40:02,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233814907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:02,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:02,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:02,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219641266] [2024-11-12 12:40:02,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:02,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:02,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:02,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:02,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:02,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 268 [2024-11-12 12:40:02,178 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-12 12:40:02,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:02,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 268 [2024-11-12 12:40:02,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:02,258 INFO L124 PetriNetUnfolderBase]: 37/538 cut-off events. [2024-11-12 12:40:02,259 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-12 12:40:02,261 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-12 12:40:02,264 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 14 selfloop transitions, 1 changer transitions 0/226 dead transitions. [2024-11-12 12:40:02,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 226 transitions, 493 flow [2024-11-12 12:40:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:02,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2024-11-12 12:40:02,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9191542288557214 [2024-11-12 12:40:02,266 INFO L175 Difference]: Start difference. First operand has 232 places, 230 transitions, 471 flow. Second operand 3 states and 739 transitions. [2024-11-12 12:40:02,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 226 transitions, 493 flow [2024-11-12 12:40:02,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 226 transitions, 489 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:02,271 INFO L231 Difference]: Finished difference. Result has 228 places, 226 transitions, 461 flow [2024-11-12 12:40:02,272 INFO L262 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-12 12:40:02,274 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -18 predicate places. [2024-11-12 12:40:02,275 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 226 transitions, 461 flow [2024-11-12 12:40:02,275 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-12 12:40:02,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:02,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:02,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:40:02,276 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-12 12:40:02,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:02,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1984190935, now seen corresponding path program 1 times [2024-11-12 12:40:02,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:02,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892904557] [2024-11-12 12:40:02,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:02,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:02,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:02,338 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-12 12:40:02,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:02,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892904557] [2024-11-12 12:40:02,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892904557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:02,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:02,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:02,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049288809] [2024-11-12 12:40:02,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:02,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:02,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:02,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:02,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:02,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2024-11-12 12:40:02,355 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-12 12:40:02,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:02,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2024-11-12 12:40:02,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:02,404 INFO L124 PetriNetUnfolderBase]: 14/291 cut-off events. [2024-11-12 12:40:02,405 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 12:40:02,406 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-12 12:40:02,409 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 10 selfloop transitions, 3 changer transitions 0/226 dead transitions. [2024-11-12 12:40:02,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 226 transitions, 489 flow [2024-11-12 12:40:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:02,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-11-12 12:40:02,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9365671641791045 [2024-11-12 12:40:02,411 INFO L175 Difference]: Start difference. First operand has 228 places, 226 transitions, 461 flow. Second operand 3 states and 753 transitions. [2024-11-12 12:40:02,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 226 transitions, 489 flow [2024-11-12 12:40:02,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 226 transitions, 488 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:02,415 INFO L231 Difference]: Finished difference. Result has 227 places, 224 transitions, 462 flow [2024-11-12 12:40:02,416 INFO L262 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-12 12:40:02,416 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -19 predicate places. [2024-11-12 12:40:02,416 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 224 transitions, 462 flow [2024-11-12 12:40:02,417 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-12 12:40:02,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:02,417 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:02,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:40:02,418 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-12 12:40:02,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:02,419 INFO L85 PathProgramCache]: Analyzing trace with hash -157970599, now seen corresponding path program 1 times [2024-11-12 12:40:02,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:02,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631210176] [2024-11-12 12:40:02,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:02,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:02,455 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-12 12:40:02,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:02,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631210176] [2024-11-12 12:40:02,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631210176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:02,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:02,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:02,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433636818] [2024-11-12 12:40:02,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:02,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:02,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:02,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:02,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:02,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 268 [2024-11-12 12:40:02,472 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-12 12:40:02,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:02,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 268 [2024-11-12 12:40:02,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:02,638 INFO L124 PetriNetUnfolderBase]: 114/1110 cut-off events. [2024-11-12 12:40:02,638 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-12 12:40:02,642 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-12 12:40:02,647 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 18 selfloop transitions, 3 changer transitions 0/229 dead transitions. [2024-11-12 12:40:02,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 229 transitions, 519 flow [2024-11-12 12:40:02,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:02,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-11-12 12:40:02,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9365671641791045 [2024-11-12 12:40:02,650 INFO L175 Difference]: Start difference. First operand has 227 places, 224 transitions, 462 flow. Second operand 3 states and 753 transitions. [2024-11-12 12:40:02,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 229 transitions, 519 flow [2024-11-12 12:40:02,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 229 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:02,659 INFO L231 Difference]: Finished difference. Result has 225 places, 224 transitions, 471 flow [2024-11-12 12:40:02,660 INFO L262 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-12 12:40:02,660 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -21 predicate places. [2024-11-12 12:40:02,661 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 224 transitions, 471 flow [2024-11-12 12:40:02,661 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-12 12:40:02,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:02,662 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:02,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:40:02,662 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-12 12:40:02,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:02,663 INFO L85 PathProgramCache]: Analyzing trace with hash 274364774, now seen corresponding path program 1 times [2024-11-12 12:40:02,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:02,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559255338] [2024-11-12 12:40:02,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:02,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:02,721 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-12 12:40:02,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:02,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559255338] [2024-11-12 12:40:02,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559255338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:02,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:02,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:02,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066245937] [2024-11-12 12:40:02,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:02,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:02,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:02,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:02,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:02,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2024-11-12 12:40:02,744 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-12 12:40:02,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:02,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2024-11-12 12:40:02,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:02,841 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-12 12:40:02,841 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2024-11-12 12:40:02,841 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2024-11-12 12:40:02,842 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-12 12:40:02,842 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-12 12:40:02,842 INFO L124 PetriNetUnfolderBase]: 53/542 cut-off events. [2024-11-12 12:40:02,842 INFO L125 PetriNetUnfolderBase]: For 17/27 co-relation queries the response was YES. [2024-11-12 12:40:02,846 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-12 12:40:02,849 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 10 selfloop transitions, 3 changer transitions 0/224 dead transitions. [2024-11-12 12:40:02,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 224 transitions, 499 flow [2024-11-12 12:40:02,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:02,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-11-12 12:40:02,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9365671641791045 [2024-11-12 12:40:02,852 INFO L175 Difference]: Start difference. First operand has 225 places, 224 transitions, 471 flow. Second operand 3 states and 753 transitions. [2024-11-12 12:40:02,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 224 transitions, 499 flow [2024-11-12 12:40:02,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 224 transitions, 499 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:40:02,857 INFO L231 Difference]: Finished difference. Result has 225 places, 222 transitions, 473 flow [2024-11-12 12:40:02,857 INFO L262 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-12 12:40:02,858 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -21 predicate places. [2024-11-12 12:40:02,858 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 222 transitions, 473 flow [2024-11-12 12:40:02,859 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-12 12:40:02,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:02,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:02,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:40:02,860 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-12 12:40:02,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:02,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1430432637, now seen corresponding path program 1 times [2024-11-12 12:40:02,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:02,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356772610] [2024-11-12 12:40:02,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:02,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:03,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:03,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:03,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356772610] [2024-11-12 12:40:03,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356772610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:03,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:03,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 12:40:03,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219923942] [2024-11-12 12:40:03,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:03,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 12:40:03,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:03,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 12:40:03,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 12:40:03,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 268 [2024-11-12 12:40:03,190 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-12 12:40:03,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:03,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 268 [2024-11-12 12:40:03,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:03,409 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-12 12:40:03,410 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2024-11-12 12:40:03,410 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2024-11-12 12:40:03,410 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-12 12:40:03,410 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-12 12:40:03,410 INFO L124 PetriNetUnfolderBase]: 56/741 cut-off events. [2024-11-12 12:40:03,410 INFO L125 PetriNetUnfolderBase]: For 9/32 co-relation queries the response was YES. [2024-11-12 12:40:03,414 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-12 12:40:03,417 INFO L140 encePairwiseOnDemand]: 255/268 looper letters, 22 selfloop transitions, 14 changer transitions 0/237 dead transitions. [2024-11-12 12:40:03,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 237 transitions, 583 flow [2024-11-12 12:40:03,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 12:40:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 12:40:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2417 transitions. [2024-11-12 12:40:03,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9018656716417911 [2024-11-12 12:40:03,423 INFO L175 Difference]: Start difference. First operand has 225 places, 222 transitions, 473 flow. Second operand 10 states and 2417 transitions. [2024-11-12 12:40:03,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 237 transitions, 583 flow [2024-11-12 12:40:03,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 237 transitions, 577 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:03,429 INFO L231 Difference]: Finished difference. Result has 236 places, 229 transitions, 533 flow [2024-11-12 12:40:03,430 INFO L262 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-12 12:40:03,430 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -10 predicate places. [2024-11-12 12:40:03,431 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 229 transitions, 533 flow [2024-11-12 12:40:03,432 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-12 12:40:03,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:03,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:03,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:40:03,432 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-12 12:40:03,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:03,434 INFO L85 PathProgramCache]: Analyzing trace with hash -470259363, now seen corresponding path program 1 times [2024-11-12 12:40:03,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:03,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491109217] [2024-11-12 12:40:03,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:03,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:03,472 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-12 12:40:03,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:03,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491109217] [2024-11-12 12:40:03,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491109217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:03,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:03,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:03,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125862408] [2024-11-12 12:40:03,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:03,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:03,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:03,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:03,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:03,485 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2024-11-12 12:40:03,486 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-12 12:40:03,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:03,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2024-11-12 12:40:03,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:03,596 INFO L124 PetriNetUnfolderBase]: 91/737 cut-off events. [2024-11-12 12:40:03,596 INFO L125 PetriNetUnfolderBase]: For 54/65 co-relation queries the response was YES. [2024-11-12 12:40:03,601 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-12 12:40:03,604 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 8 selfloop transitions, 2 changer transitions 6/229 dead transitions. [2024-11-12 12:40:03,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 229 transitions, 559 flow [2024-11-12 12:40:03,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:03,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2024-11-12 12:40:03,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9353233830845771 [2024-11-12 12:40:03,607 INFO L175 Difference]: Start difference. First operand has 236 places, 229 transitions, 533 flow. Second operand 3 states and 752 transitions. [2024-11-12 12:40:03,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 229 transitions, 559 flow [2024-11-12 12:40:03,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 229 transitions, 555 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:03,612 INFO L231 Difference]: Finished difference. Result has 235 places, 221 transitions, 516 flow [2024-11-12 12:40:03,614 INFO L262 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-12 12:40:03,614 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -11 predicate places. [2024-11-12 12:40:03,615 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 221 transitions, 516 flow [2024-11-12 12:40:03,615 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-12 12:40:03,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:03,616 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:03,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:40:03,617 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-12 12:40:03,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:03,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1552712436, now seen corresponding path program 1 times [2024-11-12 12:40:03,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:03,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375413688] [2024-11-12 12:40:03,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:03,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:03,743 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-12 12:40:03,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:03,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375413688] [2024-11-12 12:40:03,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375413688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:03,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:03,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:03,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810743415] [2024-11-12 12:40:03,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:03,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:40:03,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:03,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:40:03,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:40:03,795 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 268 [2024-11-12 12:40:03,797 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-12 12:40:03,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:03,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 268 [2024-11-12 12:40:03,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:03,978 INFO L124 PetriNetUnfolderBase]: 94/1147 cut-off events. [2024-11-12 12:40:03,978 INFO L125 PetriNetUnfolderBase]: For 56/65 co-relation queries the response was YES. [2024-11-12 12:40:03,986 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-12 12:40:03,990 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 22 selfloop transitions, 5 changer transitions 0/231 dead transitions. [2024-11-12 12:40:03,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 231 transitions, 597 flow [2024-11-12 12:40:03,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:40:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 12:40:03,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1228 transitions. [2024-11-12 12:40:03,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9164179104477612 [2024-11-12 12:40:03,994 INFO L175 Difference]: Start difference. First operand has 235 places, 221 transitions, 516 flow. Second operand 5 states and 1228 transitions. [2024-11-12 12:40:03,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 231 transitions, 597 flow [2024-11-12 12:40:03,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 231 transitions, 593 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:03,999 INFO L231 Difference]: Finished difference. Result has 233 places, 223 transitions, 537 flow [2024-11-12 12:40:04,000 INFO L262 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-12 12:40:04,000 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -13 predicate places. [2024-11-12 12:40:04,000 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 223 transitions, 537 flow [2024-11-12 12:40:04,001 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-12 12:40:04,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:04,001 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:04,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:40:04,002 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-12 12:40:04,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:04,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1491273143, now seen corresponding path program 1 times [2024-11-12 12:40:04,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:04,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436187963] [2024-11-12 12:40:04,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:04,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:04,370 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-12 12:40:04,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:04,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436187963] [2024-11-12 12:40:04,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436187963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:04,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:04,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:04,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241842528] [2024-11-12 12:40:04,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:04,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:04,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:04,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:04,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:04,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 268 [2024-11-12 12:40:04,547 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-12 12:40:04,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:04,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 268 [2024-11-12 12:40:04,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:04,739 INFO L124 PetriNetUnfolderBase]: 111/1171 cut-off events. [2024-11-12 12:40:04,739 INFO L125 PetriNetUnfolderBase]: For 138/147 co-relation queries the response was YES. [2024-11-12 12:40:04,749 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-12 12:40:04,755 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 24 selfloop transitions, 5 changer transitions 0/230 dead transitions. [2024-11-12 12:40:04,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 230 transitions, 617 flow [2024-11-12 12:40:04,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:04,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2024-11-12 12:40:04,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9054726368159204 [2024-11-12 12:40:04,759 INFO L175 Difference]: Start difference. First operand has 233 places, 223 transitions, 537 flow. Second operand 6 states and 1456 transitions. [2024-11-12 12:40:04,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 230 transitions, 617 flow [2024-11-12 12:40:04,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 230 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:04,765 INFO L231 Difference]: Finished difference. Result has 235 places, 222 transitions, 540 flow [2024-11-12 12:40:04,766 INFO L262 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-12 12:40:04,767 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -11 predicate places. [2024-11-12 12:40:04,767 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 222 transitions, 540 flow [2024-11-12 12:40:04,769 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-12 12:40:04,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:04,769 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:04,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:40:04,769 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-12 12:40:04,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:04,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1707714691, now seen corresponding path program 1 times [2024-11-12 12:40:04,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:04,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989169213] [2024-11-12 12:40:04,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:04,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:05,140 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-12 12:40:05,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:05,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989169213] [2024-11-12 12:40:05,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989169213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:05,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:05,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:05,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886223206] [2024-11-12 12:40:05,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:05,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:05,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:05,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:05,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:05,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 268 [2024-11-12 12:40:05,328 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-12 12:40:05,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:05,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 268 [2024-11-12 12:40:05,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:05,512 INFO L124 PetriNetUnfolderBase]: 181/1135 cut-off events. [2024-11-12 12:40:05,513 INFO L125 PetriNetUnfolderBase]: For 138/203 co-relation queries the response was YES. [2024-11-12 12:40:05,521 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-12 12:40:05,530 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 22 selfloop transitions, 5 changer transitions 0/229 dead transitions. [2024-11-12 12:40:05,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 229 transitions, 616 flow [2024-11-12 12:40:05,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:05,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2024-11-12 12:40:05,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9054726368159204 [2024-11-12 12:40:05,534 INFO L175 Difference]: Start difference. First operand has 235 places, 222 transitions, 540 flow. Second operand 6 states and 1456 transitions. [2024-11-12 12:40:05,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 229 transitions, 616 flow [2024-11-12 12:40:05,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 229 transitions, 606 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:40:05,540 INFO L231 Difference]: Finished difference. Result has 234 places, 221 transitions, 538 flow [2024-11-12 12:40:05,540 INFO L262 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-12 12:40:05,541 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -12 predicate places. [2024-11-12 12:40:05,541 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 221 transitions, 538 flow [2024-11-12 12:40:05,542 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-12 12:40:05,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:05,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:05,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:40:05,543 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-12 12:40:05,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash -2125255860, now seen corresponding path program 1 times [2024-11-12 12:40:05,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:05,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431136214] [2024-11-12 12:40:05,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:05,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:05,584 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-12 12:40:05,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:05,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431136214] [2024-11-12 12:40:05,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431136214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:05,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:05,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:05,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699830990] [2024-11-12 12:40:05,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:05,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:05,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:05,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:05,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:05,599 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2024-11-12 12:40:05,600 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-12 12:40:05,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:05,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2024-11-12 12:40:05,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:05,755 INFO L124 PetriNetUnfolderBase]: 83/1048 cut-off events. [2024-11-12 12:40:05,755 INFO L125 PetriNetUnfolderBase]: For 46/51 co-relation queries the response was YES. [2024-11-12 12:40:05,763 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-12 12:40:05,770 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 10 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-11-12 12:40:05,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 222 transitions, 566 flow [2024-11-12 12:40:05,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:05,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:05,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-11-12 12:40:05,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9340796019900498 [2024-11-12 12:40:05,774 INFO L175 Difference]: Start difference. First operand has 234 places, 221 transitions, 538 flow. Second operand 3 states and 751 transitions. [2024-11-12 12:40:05,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 222 transitions, 566 flow [2024-11-12 12:40:05,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 222 transitions, 556 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:40:05,779 INFO L231 Difference]: Finished difference. Result has 230 places, 220 transitions, 530 flow [2024-11-12 12:40:05,780 INFO L262 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-12 12:40:05,781 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -16 predicate places. [2024-11-12 12:40:05,781 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 220 transitions, 530 flow [2024-11-12 12:40:05,782 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-12 12:40:05,782 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:05,782 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:05,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:40:05,783 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-12 12:40:05,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:05,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1992077029, now seen corresponding path program 1 times [2024-11-12 12:40:05,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:05,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034047789] [2024-11-12 12:40:05,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:05,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:06,104 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-12 12:40:06,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:06,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034047789] [2024-11-12 12:40:06,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034047789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:06,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:06,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:06,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495500807] [2024-11-12 12:40:06,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:06,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:06,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:06,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:06,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:06,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 268 [2024-11-12 12:40:06,324 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-12 12:40:06,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:06,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 268 [2024-11-12 12:40:06,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:06,512 INFO L124 PetriNetUnfolderBase]: 90/1043 cut-off events. [2024-11-12 12:40:06,512 INFO L125 PetriNetUnfolderBase]: For 76/98 co-relation queries the response was YES. [2024-11-12 12:40:06,519 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-12 12:40:06,524 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 24 selfloop transitions, 5 changer transitions 0/227 dead transitions. [2024-11-12 12:40:06,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 227 transitions, 610 flow [2024-11-12 12:40:06,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2024-11-12 12:40:06,528 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9054726368159204 [2024-11-12 12:40:06,528 INFO L175 Difference]: Start difference. First operand has 230 places, 220 transitions, 530 flow. Second operand 6 states and 1456 transitions. [2024-11-12 12:40:06,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 227 transitions, 610 flow [2024-11-12 12:40:06,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 227 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:06,533 INFO L231 Difference]: Finished difference. Result has 232 places, 219 transitions, 534 flow [2024-11-12 12:40:06,533 INFO L262 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-12 12:40:06,534 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -14 predicate places. [2024-11-12 12:40:06,534 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 219 transitions, 534 flow [2024-11-12 12:40:06,534 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-12 12:40:06,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:06,535 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:06,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 12:40:06,535 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-12 12:40:06,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:06,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1589932602, now seen corresponding path program 1 times [2024-11-12 12:40:06,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:06,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202701542] [2024-11-12 12:40:06,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:06,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:06,573 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-12 12:40:06,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:06,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202701542] [2024-11-12 12:40:06,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202701542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:06,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:06,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:06,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076764470] [2024-11-12 12:40:06,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:06,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:06,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:06,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:06,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:06,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2024-11-12 12:40:06,589 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-12 12:40:06,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:06,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2024-11-12 12:40:06,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:06,733 INFO L124 PetriNetUnfolderBase]: 141/1096 cut-off events. [2024-11-12 12:40:06,733 INFO L125 PetriNetUnfolderBase]: For 99/120 co-relation queries the response was YES. [2024-11-12 12:40:06,742 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-12 12:40:06,744 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 10 selfloop transitions, 2 changer transitions 6/220 dead transitions. [2024-11-12 12:40:06,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 220 transitions, 562 flow [2024-11-12 12:40:06,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:06,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-11-12 12:40:06,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9340796019900498 [2024-11-12 12:40:06,747 INFO L175 Difference]: Start difference. First operand has 232 places, 219 transitions, 534 flow. Second operand 3 states and 751 transitions. [2024-11-12 12:40:06,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 220 transitions, 562 flow [2024-11-12 12:40:06,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 220 transitions, 552 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:40:06,752 INFO L231 Difference]: Finished difference. Result has 228 places, 212 transitions, 494 flow [2024-11-12 12:40:06,753 INFO L262 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-12 12:40:06,753 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -18 predicate places. [2024-11-12 12:40:06,753 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 212 transitions, 494 flow [2024-11-12 12:40:06,754 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-12 12:40:06,754 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:06,754 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:06,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 12:40:06,755 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-12 12:40:06,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:06,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1518287208, now seen corresponding path program 1 times [2024-11-12 12:40:06,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:06,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536923618] [2024-11-12 12:40:06,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:06,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:06,792 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-12 12:40:06,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:06,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536923618] [2024-11-12 12:40:06,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536923618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:06,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:06,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:06,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881784022] [2024-11-12 12:40:06,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:06,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:06,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:06,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:06,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:06,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 268 [2024-11-12 12:40:06,810 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-12 12:40:06,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:06,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 268 [2024-11-12 12:40:06,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:06,894 INFO L124 PetriNetUnfolderBase]: 56/685 cut-off events. [2024-11-12 12:40:06,895 INFO L125 PetriNetUnfolderBase]: For 10/26 co-relation queries the response was YES. [2024-11-12 12:40:06,900 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-12 12:40:06,900 INFO L140 encePairwiseOnDemand]: 265/268 looper letters, 0 selfloop transitions, 0 changer transitions 213/213 dead transitions. [2024-11-12 12:40:06,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 213 transitions, 522 flow [2024-11-12 12:40:06,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-11-12 12:40:06,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9340796019900498 [2024-11-12 12:40:06,915 INFO L175 Difference]: Start difference. First operand has 228 places, 212 transitions, 494 flow. Second operand 3 states and 751 transitions. [2024-11-12 12:40:06,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 213 transitions, 522 flow [2024-11-12 12:40:06,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 213 transitions, 498 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-11-12 12:40:06,918 INFO L231 Difference]: Finished difference. Result has 217 places, 0 transitions, 0 flow [2024-11-12 12:40:06,919 INFO L262 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-12 12:40:06,919 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -29 predicate places. [2024-11-12 12:40:06,919 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 0 transitions, 0 flow [2024-11-12 12:40:06,920 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-12 12:40:06,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2024-11-12 12:40:06,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2024-11-12 12:40:06,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2024-11-12 12:40:06,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2024-11-12 12:40:06,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2024-11-12 12:40:06,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2024-11-12 12:40:06,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2024-11-12 12:40:06,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2024-11-12 12:40:06,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2024-11-12 12:40:06,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2024-11-12 12:40:06,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2024-11-12 12:40:06,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2024-11-12 12:40:06,927 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2024-11-12 12:40:06,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2024-11-12 12:40:06,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2024-11-12 12:40:06,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2024-11-12 12:40:06,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2024-11-12 12:40:06,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2024-11-12 12:40:06,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2024-11-12 12:40:06,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2024-11-12 12:40:06,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2024-11-12 12:40:06,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2024-11-12 12:40:06,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2024-11-12 12:40:06,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2024-11-12 12:40:06,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2024-11-12 12:40:06,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2024-11-12 12:40:06,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2024-11-12 12:40:06,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 46 remaining) [2024-11-12 12:40:06,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 46 remaining) [2024-11-12 12:40:06,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 46 remaining) [2024-11-12 12:40:06,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2024-11-12 12:40:06,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2024-11-12 12:40:06,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2024-11-12 12:40:06,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2024-11-12 12:40:06,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2024-11-12 12:40:06,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2024-11-12 12:40:06,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2024-11-12 12:40:06,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2024-11-12 12:40:06,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2024-11-12 12:40:06,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2024-11-12 12:40:06,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2024-11-12 12:40:06,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2024-11-12 12:40:06,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2024-11-12 12:40:06,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2024-11-12 12:40:06,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2024-11-12 12:40:06,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2024-11-12 12:40:06,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 12:40:06,934 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:06,941 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 12:40:06,941 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:40:06,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:40:06 BasicIcfg [2024-11-12 12:40:06,946 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:40:06,946 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:40:06,946 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:40:06,946 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:40:06,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:39:59" (3/4) ... [2024-11-12 12:40:06,948 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 12:40:06,952 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-12 12:40:06,952 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-12 12:40:06,952 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-12 12:40:06,958 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-12 12:40:06,959 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 12:40:06,959 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 12:40:06,959 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 12:40:07,064 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:40:07,065 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 12:40:07,065 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:40:07,066 INFO L158 Benchmark]: Toolchain (without parser) took 8842.45ms. Allocated memory was 161.5MB in the beginning and 297.8MB in the end (delta: 136.3MB). Free memory was 106.9MB in the beginning and 248.1MB in the end (delta: -141.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:40:07,066 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 161.5MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:40:07,066 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.71ms. Allocated memory is still 161.5MB. Free memory was 106.9MB in the beginning and 91.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 12:40:07,066 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.46ms. Allocated memory is still 161.5MB. Free memory was 91.6MB in the beginning and 90.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:40:07,067 INFO L158 Benchmark]: Boogie Preprocessor took 67.79ms. Allocated memory is still 161.5MB. Free memory was 89.5MB in the beginning and 88.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:40:07,067 INFO L158 Benchmark]: RCFGBuilder took 638.63ms. Allocated memory is still 161.5MB. Free memory was 88.0MB in the beginning and 64.1MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 12:40:07,067 INFO L158 Benchmark]: TraceAbstraction took 7608.76ms. Allocated memory was 161.5MB in the beginning and 297.8MB in the end (delta: 136.3MB). Free memory was 62.9MB in the beginning and 253.4MB in the end (delta: -190.5MB). Peak memory consumption was 115.9MB. Max. memory is 16.1GB. [2024-11-12 12:40:07,068 INFO L158 Benchmark]: Witness Printer took 118.80ms. Allocated memory is still 297.8MB. Free memory was 253.4MB in the beginning and 248.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 12:40:07,069 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.27ms. Allocated memory is still 161.5MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.71ms. Allocated memory is still 161.5MB. Free memory was 106.9MB in the beginning and 91.6MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.46ms. Allocated memory is still 161.5MB. Free memory was 91.6MB in the beginning and 90.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.79ms. Allocated memory is still 161.5MB. Free memory was 89.5MB in the beginning and 88.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 638.63ms. Allocated memory is still 161.5MB. Free memory was 88.0MB in the beginning and 64.1MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7608.76ms. Allocated memory was 161.5MB in the beginning and 297.8MB in the end (delta: 136.3MB). Free memory was 62.9MB in the beginning and 253.4MB in the end (delta: -190.5MB). Peak memory consumption was 115.9MB. Max. memory is 16.1GB. * Witness Printer took 118.80ms. Allocated memory is still 297.8MB. Free memory was 253.4MB in the beginning and 248.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. 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.4s, 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.3s InterpolantComputationTime, 1540 NumberOfCodeBlocks, 1540 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1522 ConstructedInterpolants, 0 QuantifiedInterpolants, 2228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 3/3 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-12 12:40:07,104 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