./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.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 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:57:24,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:57:24,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:57:24,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:57:24,843 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:57:24,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:57:24,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:57:24,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:57:24,874 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:57:24,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:57:24,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:57:24,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:57:24,877 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:57:24,877 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:57:24,877 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:57:24,877 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:57:24,878 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:57:24,878 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:57:24,878 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:57:24,879 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:57:24,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:57:24,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:57:24,884 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:57:24,884 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:57:24,884 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:57:24,884 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:57:24,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:57:24,885 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:57:24,885 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:57:24,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:57:24,886 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:57:24,886 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:57:24,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:57:24,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:57:24,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:57:24,889 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:57:24,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:57:24,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:57:24,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:57:24,890 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:57:24,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:57:24,890 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 [2024-10-13 09:57:25,149 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:57:25,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:57:25,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:57:25,180 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:57:25,180 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:57:25,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2024-10-13 09:57:26,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:57:26,860 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:57:26,863 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2024-10-13 09:57:26,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd92f6dd9/bca39521b9ca4885b8431115f1bcca45/FLAGcb28e9041 [2024-10-13 09:57:26,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd92f6dd9/bca39521b9ca4885b8431115f1bcca45 [2024-10-13 09:57:26,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:57:26,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:57:26,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:57:26,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:57:26,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:57:26,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:26" (1/1) ... [2024-10-13 09:57:26,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5614bb82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:26, skipping insertion in model container [2024-10-13 09:57:26,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:57:26" (1/1) ... [2024-10-13 09:57:26,936 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:57:27,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:57:27,225 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:57:27,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:57:27,287 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:57:27,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:27 WrapperNode [2024-10-13 09:57:27,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:57:27,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:57:27,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:57:27,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:57:27,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:27" (1/1) ... [2024-10-13 09:57:27,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:27" (1/1) ... [2024-10-13 09:57:27,366 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 797 [2024-10-13 09:57:27,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:57:27,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:57:27,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:57:27,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:57:27,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:27" (1/1) ... [2024-10-13 09:57:27,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:27" (1/1) ... [2024-10-13 09:57:27,395 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:27" (1/1) ... [2024-10-13 09:57:27,395 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:27" (1/1) ... [2024-10-13 09:57:27,432 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:27" (1/1) ... [2024-10-13 09:57:27,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:27" (1/1) ... [2024-10-13 09:57:27,443 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:27" (1/1) ... [2024-10-13 09:57:27,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:27" (1/1) ... [2024-10-13 09:57:27,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:57:27,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:57:27,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:57:27,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:57:27,460 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:27" (1/1) ... [2024-10-13 09:57:27,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:57:27,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:57:27,508 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:57:27,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:57:27,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:57:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 09:57:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 09:57:27,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:57:27,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:57:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:57:27,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:57:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 09:57:27,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 09:57:27,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:57:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:57:27,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:57:27,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:57:27,573 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:57:27,746 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:57:27,749 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:57:29,004 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:57:29,004 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:57:29,066 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:57:29,066 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-13 09:57:29,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:29 BoogieIcfgContainer [2024-10-13 09:57:29,067 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:57:29,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:57:29,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:57:29,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:57:29,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:57:26" (1/3) ... [2024-10-13 09:57:29,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571f34ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:29, skipping insertion in model container [2024-10-13 09:57:29,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:57:27" (2/3) ... [2024-10-13 09:57:29,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571f34ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:57:29, skipping insertion in model container [2024-10-13 09:57:29,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:57:29" (3/3) ... [2024-10-13 09:57:29,082 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2024-10-13 09:57:29,098 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:57:29,098 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 116 error locations. [2024-10-13 09:57:29,099 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:57:29,307 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 09:57:29,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1016 places, 1054 transitions, 2129 flow [2024-10-13 09:57:29,832 INFO L124 PetriNetUnfolderBase]: 48/1051 cut-off events. [2024-10-13 09:57:29,833 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:57:29,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1064 conditions, 1051 events. 48/1051 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2176 event pairs, 0 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 855. Up to 2 conditions per place. [2024-10-13 09:57:29,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 1016 places, 1054 transitions, 2129 flow [2024-10-13 09:57:29,878 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 993 places, 1028 transitions, 2074 flow [2024-10-13 09:57:29,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:57:29,899 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;@4a456866, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:57:29,900 INFO L334 AbstractCegarLoop]: Starting to check reachability of 194 error locations. [2024-10-13 09:57:29,905 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:57:29,905 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2024-10-13 09:57:29,905 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:57:29,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:29,906 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:29,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:29,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:29,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2026280969, now seen corresponding path program 1 times [2024-10-13 09:57:29,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:29,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008762993] [2024-10-13 09:57:29,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:29,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:30,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:30,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:30,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008762993] [2024-10-13 09:57:30,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008762993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:30,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:30,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:30,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877502556] [2024-10-13 09:57:30,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:30,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:30,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:30,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:30,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:30,278 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1054 [2024-10-13 09:57:30,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 993 places, 1028 transitions, 2074 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:30,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:30,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1054 [2024-10-13 09:57:30,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:31,038 INFO L124 PetriNetUnfolderBase]: 86/2508 cut-off events. [2024-10-13 09:57:31,038 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-10-13 09:57:31,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 2508 events. 86/2508 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 14336 event pairs, 39 based on Foata normal form. 68/2125 useless extension candidates. Maximal degree in co-relation 1937. Up to 89 conditions per place. [2024-10-13 09:57:31,100 INFO L140 encePairwiseOnDemand]: 1023/1054 looper letters, 19 selfloop transitions, 2 changer transitions 16/999 dead transitions. [2024-10-13 09:57:31,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 994 places, 999 transitions, 2058 flow [2024-10-13 09:57:31,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3053 transitions. [2024-10-13 09:57:31,128 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.965528146742568 [2024-10-13 09:57:31,131 INFO L175 Difference]: Start difference. First operand has 993 places, 1028 transitions, 2074 flow. Second operand 3 states and 3053 transitions. [2024-10-13 09:57:31,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 994 places, 999 transitions, 2058 flow [2024-10-13 09:57:31,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 988 places, 999 transitions, 2046 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 09:57:31,159 INFO L231 Difference]: Finished difference. Result has 988 places, 983 transitions, 1976 flow [2024-10-13 09:57:31,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=2004, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=997, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1976, PETRI_PLACES=988, PETRI_TRANSITIONS=983} [2024-10-13 09:57:31,168 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -5 predicate places. [2024-10-13 09:57:31,168 INFO L471 AbstractCegarLoop]: Abstraction has has 988 places, 983 transitions, 1976 flow [2024-10-13 09:57:31,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:31,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:31,171 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:31,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:57:31,171 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:31,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:31,172 INFO L85 PathProgramCache]: Analyzing trace with hash 135341622, now seen corresponding path program 1 times [2024-10-13 09:57:31,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:31,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503080094] [2024-10-13 09:57:31,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:31,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:31,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:31,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:31,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503080094] [2024-10-13 09:57:31,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503080094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:31,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:31,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:31,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419410969] [2024-10-13 09:57:31,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:31,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:31,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:31,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:31,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:31,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1054 [2024-10-13 09:57:31,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 983 transitions, 1976 flow. Second operand has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:31,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:31,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1054 [2024-10-13 09:57:31,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:32,514 INFO L124 PetriNetUnfolderBase]: 212/3960 cut-off events. [2024-10-13 09:57:32,515 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-13 09:57:32,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4280 conditions, 3960 events. 212/3960 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 29672 event pairs, 132 based on Foata normal form. 0/3318 useless extension candidates. Maximal degree in co-relation 4237. Up to 257 conditions per place. [2024-10-13 09:57:32,589 INFO L140 encePairwiseOnDemand]: 1043/1054 looper letters, 26 selfloop transitions, 1 changer transitions 0/973 dead transitions. [2024-10-13 09:57:32,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 964 places, 973 transitions, 2010 flow [2024-10-13 09:57:32,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:32,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2024-10-13 09:57:32,596 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.948134092346616 [2024-10-13 09:57:32,596 INFO L175 Difference]: Start difference. First operand has 988 places, 983 transitions, 1976 flow. Second operand 3 states and 2998 transitions. [2024-10-13 09:57:32,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 964 places, 973 transitions, 2010 flow [2024-10-13 09:57:32,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 962 places, 973 transitions, 2006 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:32,611 INFO L231 Difference]: Finished difference. Result has 962 places, 973 transitions, 1954 flow [2024-10-13 09:57:32,613 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1952, PETRI_DIFFERENCE_MINUEND_PLACES=960, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=972, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1954, PETRI_PLACES=962, PETRI_TRANSITIONS=973} [2024-10-13 09:57:32,614 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -31 predicate places. [2024-10-13 09:57:32,614 INFO L471 AbstractCegarLoop]: Abstraction has has 962 places, 973 transitions, 1954 flow [2024-10-13 09:57:32,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:32,616 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:32,617 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:32,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:57:32,617 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:32,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:32,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1957615406, now seen corresponding path program 1 times [2024-10-13 09:57:32,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:32,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484805674] [2024-10-13 09:57:32,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:32,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:32,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:32,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484805674] [2024-10-13 09:57:32,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484805674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:32,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:32,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:32,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569430596] [2024-10-13 09:57:32,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:32,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:32,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:32,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:32,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:32,763 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1054 [2024-10-13 09:57:32,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 962 places, 973 transitions, 1954 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:32,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:32,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1054 [2024-10-13 09:57:32,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:33,362 INFO L124 PetriNetUnfolderBase]: 62/2211 cut-off events. [2024-10-13 09:57:33,363 INFO L125 PetriNetUnfolderBase]: For 9/16 co-relation queries the response was YES. [2024-10-13 09:57:33,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2287 conditions, 2211 events. 62/2211 cut-off events. For 9/16 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 11135 event pairs, 21 based on Foata normal form. 0/1845 useless extension candidates. Maximal degree in co-relation 2244. Up to 62 conditions per place. [2024-10-13 09:57:33,414 INFO L140 encePairwiseOnDemand]: 1051/1054 looper letters, 19 selfloop transitions, 2 changer transitions 0/972 dead transitions. [2024-10-13 09:57:33,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 963 places, 972 transitions, 1994 flow [2024-10-13 09:57:33,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:33,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3025 transitions. [2024-10-13 09:57:33,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9566729917773561 [2024-10-13 09:57:33,424 INFO L175 Difference]: Start difference. First operand has 962 places, 973 transitions, 1954 flow. Second operand 3 states and 3025 transitions. [2024-10-13 09:57:33,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 963 places, 972 transitions, 1994 flow [2024-10-13 09:57:33,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 962 places, 972 transitions, 1993 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:57:33,440 INFO L231 Difference]: Finished difference. Result has 962 places, 972 transitions, 1955 flow [2024-10-13 09:57:33,442 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=960, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=972, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=970, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1955, PETRI_PLACES=962, PETRI_TRANSITIONS=972} [2024-10-13 09:57:33,443 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -31 predicate places. [2024-10-13 09:57:33,444 INFO L471 AbstractCegarLoop]: Abstraction has has 962 places, 972 transitions, 1955 flow [2024-10-13 09:57:33,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:33,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:33,447 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:33,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:57:33,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:33,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:33,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1220255805, now seen corresponding path program 1 times [2024-10-13 09:57:33,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:33,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446966458] [2024-10-13 09:57:33,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:33,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:33,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:33,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:33,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446966458] [2024-10-13 09:57:33,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446966458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:33,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:33,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:33,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755626558] [2024-10-13 09:57:33,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:33,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:33,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:33,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:33,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:33,566 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1054 [2024-10-13 09:57:33,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 962 places, 972 transitions, 1955 flow. Second operand has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:33,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:33,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1054 [2024-10-13 09:57:33,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:34,405 INFO L124 PetriNetUnfolderBase]: 116/2624 cut-off events. [2024-10-13 09:57:34,405 INFO L125 PetriNetUnfolderBase]: For 17/119 co-relation queries the response was YES. [2024-10-13 09:57:34,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2795 conditions, 2624 events. 116/2624 cut-off events. For 17/119 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 15867 event pairs, 60 based on Foata normal form. 0/2222 useless extension candidates. Maximal degree in co-relation 2753. Up to 149 conditions per place. [2024-10-13 09:57:34,490 INFO L140 encePairwiseOnDemand]: 1043/1054 looper letters, 26 selfloop transitions, 1 changer transitions 0/962 dead transitions. [2024-10-13 09:57:34,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 954 places, 962 transitions, 1989 flow [2024-10-13 09:57:34,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:34,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2024-10-13 09:57:34,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.948134092346616 [2024-10-13 09:57:34,499 INFO L175 Difference]: Start difference. First operand has 962 places, 972 transitions, 1955 flow. Second operand 3 states and 2998 transitions. [2024-10-13 09:57:34,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 954 places, 962 transitions, 1989 flow [2024-10-13 09:57:34,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 952 places, 962 transitions, 1985 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:34,518 INFO L231 Difference]: Finished difference. Result has 952 places, 962 transitions, 1933 flow [2024-10-13 09:57:34,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1931, PETRI_DIFFERENCE_MINUEND_PLACES=950, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=961, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1933, PETRI_PLACES=952, PETRI_TRANSITIONS=962} [2024-10-13 09:57:34,521 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -41 predicate places. [2024-10-13 09:57:34,522 INFO L471 AbstractCegarLoop]: Abstraction has has 952 places, 962 transitions, 1933 flow [2024-10-13 09:57:34,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:34,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:34,524 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:34,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:57:34,525 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:34,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:34,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1507343733, now seen corresponding path program 1 times [2024-10-13 09:57:34,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:34,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154523506] [2024-10-13 09:57:34,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:34,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:34,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:34,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:34,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154523506] [2024-10-13 09:57:34,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154523506] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:34,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:34,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:34,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490546524] [2024-10-13 09:57:34,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:34,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:34,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:34,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:34,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:34,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1054 [2024-10-13 09:57:34,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 962 transitions, 1933 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:34,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:34,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1054 [2024-10-13 09:57:34,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:35,080 INFO L124 PetriNetUnfolderBase]: 74/1837 cut-off events. [2024-10-13 09:57:35,080 INFO L125 PetriNetUnfolderBase]: For 20/47 co-relation queries the response was YES. [2024-10-13 09:57:35,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 1837 events. 74/1837 cut-off events. For 20/47 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8460 event pairs, 39 based on Foata normal form. 0/1563 useless extension candidates. Maximal degree in co-relation 1895. Up to 89 conditions per place. [2024-10-13 09:57:35,120 INFO L140 encePairwiseOnDemand]: 1051/1054 looper letters, 19 selfloop transitions, 2 changer transitions 0/961 dead transitions. [2024-10-13 09:57:35,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 961 transitions, 1973 flow [2024-10-13 09:57:35,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:35,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3025 transitions. [2024-10-13 09:57:35,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9566729917773561 [2024-10-13 09:57:35,127 INFO L175 Difference]: Start difference. First operand has 952 places, 962 transitions, 1933 flow. Second operand 3 states and 3025 transitions. [2024-10-13 09:57:35,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 961 transitions, 1973 flow [2024-10-13 09:57:35,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 952 places, 961 transitions, 1972 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:57:35,141 INFO L231 Difference]: Finished difference. Result has 952 places, 961 transitions, 1934 flow [2024-10-13 09:57:35,143 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=950, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=961, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1934, PETRI_PLACES=952, PETRI_TRANSITIONS=961} [2024-10-13 09:57:35,144 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -41 predicate places. [2024-10-13 09:57:35,144 INFO L471 AbstractCegarLoop]: Abstraction has has 952 places, 961 transitions, 1934 flow [2024-10-13 09:57:35,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:35,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:35,147 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:35,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:57:35,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:35,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:35,148 INFO L85 PathProgramCache]: Analyzing trace with hash 319350018, now seen corresponding path program 1 times [2024-10-13 09:57:35,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:35,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490832118] [2024-10-13 09:57:35,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:35,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:35,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:35,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490832118] [2024-10-13 09:57:35,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490832118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:35,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:35,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:35,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934337097] [2024-10-13 09:57:35,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:35,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:35,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:35,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:35,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:35,256 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1054 [2024-10-13 09:57:35,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 961 transitions, 1934 flow. Second operand has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:35,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:35,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1054 [2024-10-13 09:57:35,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:36,178 INFO L124 PetriNetUnfolderBase]: 226/3707 cut-off events. [2024-10-13 09:57:36,179 INFO L125 PetriNetUnfolderBase]: For 65/94 co-relation queries the response was YES. [2024-10-13 09:57:36,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3998 conditions, 3707 events. 226/3707 cut-off events. For 65/94 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 26673 event pairs, 132 based on Foata normal form. 0/3158 useless extension candidates. Maximal degree in co-relation 3956. Up to 274 conditions per place. [2024-10-13 09:57:36,233 INFO L140 encePairwiseOnDemand]: 1043/1054 looper letters, 26 selfloop transitions, 1 changer transitions 0/951 dead transitions. [2024-10-13 09:57:36,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 944 places, 951 transitions, 1968 flow [2024-10-13 09:57:36,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:36,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2024-10-13 09:57:36,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.948134092346616 [2024-10-13 09:57:36,240 INFO L175 Difference]: Start difference. First operand has 952 places, 961 transitions, 1934 flow. Second operand 3 states and 2998 transitions. [2024-10-13 09:57:36,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 944 places, 951 transitions, 1968 flow [2024-10-13 09:57:36,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 942 places, 951 transitions, 1964 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:36,255 INFO L231 Difference]: Finished difference. Result has 942 places, 951 transitions, 1912 flow [2024-10-13 09:57:36,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=940, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=951, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=950, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1912, PETRI_PLACES=942, PETRI_TRANSITIONS=951} [2024-10-13 09:57:36,259 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -51 predicate places. [2024-10-13 09:57:36,259 INFO L471 AbstractCegarLoop]: Abstraction has has 942 places, 951 transitions, 1912 flow [2024-10-13 09:57:36,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:36,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:36,262 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:36,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:57:36,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:36,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:36,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1660174462, now seen corresponding path program 1 times [2024-10-13 09:57:36,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:36,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775116903] [2024-10-13 09:57:36,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:36,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:36,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:36,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775116903] [2024-10-13 09:57:36,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775116903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:36,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:36,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:36,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778163666] [2024-10-13 09:57:36,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:36,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:36,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:36,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:36,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:36,356 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1009 out of 1054 [2024-10-13 09:57:36,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 942 places, 951 transitions, 1912 flow. Second operand has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:36,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:36,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1009 of 1054 [2024-10-13 09:57:36,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:36,607 INFO L124 PetriNetUnfolderBase]: 25/1251 cut-off events. [2024-10-13 09:57:36,608 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-13 09:57:36,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 1251 events. 25/1251 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3310 event pairs, 2 based on Foata normal form. 0/1097 useless extension candidates. Maximal degree in co-relation 1236. Up to 16 conditions per place. [2024-10-13 09:57:36,631 INFO L140 encePairwiseOnDemand]: 1051/1054 looper letters, 11 selfloop transitions, 2 changer transitions 0/950 dead transitions. [2024-10-13 09:57:36,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 950 transitions, 1936 flow [2024-10-13 09:57:36,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3041 transitions. [2024-10-13 09:57:36,638 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9617330803289058 [2024-10-13 09:57:36,638 INFO L175 Difference]: Start difference. First operand has 942 places, 951 transitions, 1912 flow. Second operand 3 states and 3041 transitions. [2024-10-13 09:57:36,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 950 transitions, 1936 flow [2024-10-13 09:57:36,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 942 places, 950 transitions, 1935 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:57:36,653 INFO L231 Difference]: Finished difference. Result has 942 places, 950 transitions, 1913 flow [2024-10-13 09:57:36,655 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1909, PETRI_DIFFERENCE_MINUEND_PLACES=940, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=950, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=948, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1913, PETRI_PLACES=942, PETRI_TRANSITIONS=950} [2024-10-13 09:57:36,656 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -51 predicate places. [2024-10-13 09:57:36,656 INFO L471 AbstractCegarLoop]: Abstraction has has 942 places, 950 transitions, 1913 flow [2024-10-13 09:57:36,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:36,659 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:36,659 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:36,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:57:36,659 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:36,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:36,660 INFO L85 PathProgramCache]: Analyzing trace with hash -720464191, now seen corresponding path program 1 times [2024-10-13 09:57:36,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:36,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320787695] [2024-10-13 09:57:36,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:36,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:36,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:36,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320787695] [2024-10-13 09:57:36,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320787695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:36,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:36,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:36,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502291540] [2024-10-13 09:57:36,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:36,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:36,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:36,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:36,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:36,742 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1054 [2024-10-13 09:57:36,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 942 places, 950 transitions, 1913 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:36,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:36,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1054 [2024-10-13 09:57:36,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:37,122 INFO L124 PetriNetUnfolderBase]: 41/1852 cut-off events. [2024-10-13 09:57:37,123 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2024-10-13 09:57:37,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 1852 events. 41/1852 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8286 event pairs, 6 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 1852. Up to 25 conditions per place. [2024-10-13 09:57:37,148 INFO L140 encePairwiseOnDemand]: 1051/1054 looper letters, 12 selfloop transitions, 2 changer transitions 0/949 dead transitions. [2024-10-13 09:57:37,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 949 transitions, 1939 flow [2024-10-13 09:57:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:37,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:37,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2024-10-13 09:57:37,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961100569259962 [2024-10-13 09:57:37,156 INFO L175 Difference]: Start difference. First operand has 942 places, 950 transitions, 1913 flow. Second operand 3 states and 3039 transitions. [2024-10-13 09:57:37,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 949 transitions, 1939 flow [2024-10-13 09:57:37,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 941 places, 949 transitions, 1935 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:37,170 INFO L231 Difference]: Finished difference. Result has 941 places, 949 transitions, 1911 flow [2024-10-13 09:57:37,172 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1907, PETRI_DIFFERENCE_MINUEND_PLACES=939, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=949, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1911, PETRI_PLACES=941, PETRI_TRANSITIONS=949} [2024-10-13 09:57:37,172 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -52 predicate places. [2024-10-13 09:57:37,173 INFO L471 AbstractCegarLoop]: Abstraction has has 941 places, 949 transitions, 1911 flow [2024-10-13 09:57:37,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:37,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:37,175 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:37,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:57:37,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:37,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:37,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2057582347, now seen corresponding path program 1 times [2024-10-13 09:57:37,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:37,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922269096] [2024-10-13 09:57:37,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:37,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:37,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:37,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922269096] [2024-10-13 09:57:37,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922269096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:37,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:37,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:37,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602090104] [2024-10-13 09:57:37,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:37,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:37,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:37,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:37,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:37,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1054 [2024-10-13 09:57:37,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 941 places, 949 transitions, 1911 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:37,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:37,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1054 [2024-10-13 09:57:37,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:37,593 INFO L124 PetriNetUnfolderBase]: 41/1851 cut-off events. [2024-10-13 09:57:37,594 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2024-10-13 09:57:37,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 1851 events. 41/1851 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8271 event pairs, 6 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 1851. Up to 25 conditions per place. [2024-10-13 09:57:37,640 INFO L140 encePairwiseOnDemand]: 1051/1054 looper letters, 12 selfloop transitions, 2 changer transitions 0/948 dead transitions. [2024-10-13 09:57:37,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 942 places, 948 transitions, 1937 flow [2024-10-13 09:57:37,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:37,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2024-10-13 09:57:37,646 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961100569259962 [2024-10-13 09:57:37,646 INFO L175 Difference]: Start difference. First operand has 941 places, 949 transitions, 1911 flow. Second operand 3 states and 3039 transitions. [2024-10-13 09:57:37,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 942 places, 948 transitions, 1937 flow [2024-10-13 09:57:37,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 940 places, 948 transitions, 1933 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:37,661 INFO L231 Difference]: Finished difference. Result has 940 places, 948 transitions, 1909 flow [2024-10-13 09:57:37,662 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=938, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1909, PETRI_PLACES=940, PETRI_TRANSITIONS=948} [2024-10-13 09:57:37,663 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -53 predicate places. [2024-10-13 09:57:37,663 INFO L471 AbstractCegarLoop]: Abstraction has has 940 places, 948 transitions, 1909 flow [2024-10-13 09:57:37,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:37,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:37,666 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:37,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:57:37,666 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:37,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:37,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1458072727, now seen corresponding path program 1 times [2024-10-13 09:57:37,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:37,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304938492] [2024-10-13 09:57:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:37,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:37,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:37,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:37,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304938492] [2024-10-13 09:57:37,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304938492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:37,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:37,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:37,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255903246] [2024-10-13 09:57:37,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:37,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:37,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:37,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:37,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:37,737 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1054 [2024-10-13 09:57:37,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 940 places, 948 transitions, 1909 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:37,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:37,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1054 [2024-10-13 09:57:37,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:37,948 INFO L124 PetriNetUnfolderBase]: 22/1098 cut-off events. [2024-10-13 09:57:37,948 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2024-10-13 09:57:37,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 1098 events. 22/1098 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2525 event pairs, 2 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 1085. Up to 17 conditions per place. [2024-10-13 09:57:37,970 INFO L140 encePairwiseOnDemand]: 1051/1054 looper letters, 12 selfloop transitions, 2 changer transitions 0/947 dead transitions. [2024-10-13 09:57:37,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 941 places, 947 transitions, 1935 flow [2024-10-13 09:57:37,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2024-10-13 09:57:37,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961100569259962 [2024-10-13 09:57:37,977 INFO L175 Difference]: Start difference. First operand has 940 places, 948 transitions, 1909 flow. Second operand 3 states and 3039 transitions. [2024-10-13 09:57:37,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 941 places, 947 transitions, 1935 flow [2024-10-13 09:57:37,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 939 places, 947 transitions, 1931 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:37,993 INFO L231 Difference]: Finished difference. Result has 939 places, 947 transitions, 1907 flow [2024-10-13 09:57:37,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1903, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=945, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1907, PETRI_PLACES=939, PETRI_TRANSITIONS=947} [2024-10-13 09:57:37,996 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -54 predicate places. [2024-10-13 09:57:37,997 INFO L471 AbstractCegarLoop]: Abstraction has has 939 places, 947 transitions, 1907 flow [2024-10-13 09:57:37,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:37,999 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:38,000 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:38,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:57:38,000 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:38,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:38,001 INFO L85 PathProgramCache]: Analyzing trace with hash 60252526, now seen corresponding path program 1 times [2024-10-13 09:57:38,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:38,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478716415] [2024-10-13 09:57:38,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:38,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:38,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:38,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:38,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478716415] [2024-10-13 09:57:38,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478716415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:38,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:38,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:38,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607266460] [2024-10-13 09:57:38,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:38,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:38,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:38,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:38,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:38,084 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1054 [2024-10-13 09:57:38,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 947 transitions, 1907 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:38,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:38,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1054 [2024-10-13 09:57:38,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:38,455 INFO L124 PetriNetUnfolderBase]: 32/1399 cut-off events. [2024-10-13 09:57:38,455 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2024-10-13 09:57:38,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 1399 events. 32/1399 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4844 event pairs, 6 based on Foata normal form. 0/1222 useless extension candidates. Maximal degree in co-relation 1396. Up to 25 conditions per place. [2024-10-13 09:57:38,486 INFO L140 encePairwiseOnDemand]: 1051/1054 looper letters, 12 selfloop transitions, 2 changer transitions 0/946 dead transitions. [2024-10-13 09:57:38,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 940 places, 946 transitions, 1933 flow [2024-10-13 09:57:38,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2024-10-13 09:57:38,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961100569259962 [2024-10-13 09:57:38,491 INFO L175 Difference]: Start difference. First operand has 939 places, 947 transitions, 1907 flow. Second operand 3 states and 3039 transitions. [2024-10-13 09:57:38,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 940 places, 946 transitions, 1933 flow [2024-10-13 09:57:38,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 938 places, 946 transitions, 1929 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:38,505 INFO L231 Difference]: Finished difference. Result has 938 places, 946 transitions, 1905 flow [2024-10-13 09:57:38,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=936, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=946, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=944, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1905, PETRI_PLACES=938, PETRI_TRANSITIONS=946} [2024-10-13 09:57:38,507 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -55 predicate places. [2024-10-13 09:57:38,507 INFO L471 AbstractCegarLoop]: Abstraction has has 938 places, 946 transitions, 1905 flow [2024-10-13 09:57:38,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:38,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:38,509 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:38,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:57:38,510 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:38,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:38,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1490239202, now seen corresponding path program 1 times [2024-10-13 09:57:38,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:38,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411993976] [2024-10-13 09:57:38,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:38,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:38,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:38,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:38,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411993976] [2024-10-13 09:57:38,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411993976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:38,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:38,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:38,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226894159] [2024-10-13 09:57:38,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:38,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:38,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:38,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:38,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:38,587 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1054 [2024-10-13 09:57:38,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 938 places, 946 transitions, 1905 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:38,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:38,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1054 [2024-10-13 09:57:38,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:38,922 INFO L124 PetriNetUnfolderBase]: 32/1398 cut-off events. [2024-10-13 09:57:38,922 INFO L125 PetriNetUnfolderBase]: For 4/28 co-relation queries the response was YES. [2024-10-13 09:57:38,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1438 conditions, 1398 events. 32/1398 cut-off events. For 4/28 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4824 event pairs, 6 based on Foata normal form. 0/1223 useless extension candidates. Maximal degree in co-relation 1395. Up to 25 conditions per place. [2024-10-13 09:57:38,951 INFO L140 encePairwiseOnDemand]: 1051/1054 looper letters, 12 selfloop transitions, 2 changer transitions 0/945 dead transitions. [2024-10-13 09:57:38,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 945 transitions, 1931 flow [2024-10-13 09:57:38,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:38,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2024-10-13 09:57:38,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961100569259962 [2024-10-13 09:57:38,956 INFO L175 Difference]: Start difference. First operand has 938 places, 946 transitions, 1905 flow. Second operand 3 states and 3039 transitions. [2024-10-13 09:57:38,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 945 transitions, 1931 flow [2024-10-13 09:57:38,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 945 transitions, 1927 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:38,969 INFO L231 Difference]: Finished difference. Result has 937 places, 945 transitions, 1903 flow [2024-10-13 09:57:38,970 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1903, PETRI_PLACES=937, PETRI_TRANSITIONS=945} [2024-10-13 09:57:38,971 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -56 predicate places. [2024-10-13 09:57:38,971 INFO L471 AbstractCegarLoop]: Abstraction has has 937 places, 945 transitions, 1903 flow [2024-10-13 09:57:38,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:38,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:38,973 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:38,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:57:38,973 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:38,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:38,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1469288582, now seen corresponding path program 1 times [2024-10-13 09:57:38,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:38,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729497405] [2024-10-13 09:57:38,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:38,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:39,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:39,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729497405] [2024-10-13 09:57:39,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729497405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:39,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:39,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:39,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167751197] [2024-10-13 09:57:39,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:39,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:39,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:39,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:39,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:39,047 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1054 [2024-10-13 09:57:39,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 945 transitions, 1903 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:39,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:39,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1054 [2024-10-13 09:57:39,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:39,231 INFO L124 PetriNetUnfolderBase]: 19/974 cut-off events. [2024-10-13 09:57:39,231 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-10-13 09:57:39,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 974 events. 19/974 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2070 event pairs, 2 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 960. Up to 17 conditions per place. [2024-10-13 09:57:39,244 INFO L140 encePairwiseOnDemand]: 1051/1054 looper letters, 12 selfloop transitions, 2 changer transitions 0/944 dead transitions. [2024-10-13 09:57:39,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 944 transitions, 1929 flow [2024-10-13 09:57:39,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2024-10-13 09:57:39,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961100569259962 [2024-10-13 09:57:39,249 INFO L175 Difference]: Start difference. First operand has 937 places, 945 transitions, 1903 flow. Second operand 3 states and 3039 transitions. [2024-10-13 09:57:39,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 944 transitions, 1929 flow [2024-10-13 09:57:39,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 944 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:39,259 INFO L231 Difference]: Finished difference. Result has 936 places, 944 transitions, 1901 flow [2024-10-13 09:57:39,260 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=934, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=942, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1901, PETRI_PLACES=936, PETRI_TRANSITIONS=944} [2024-10-13 09:57:39,261 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -57 predicate places. [2024-10-13 09:57:39,261 INFO L471 AbstractCegarLoop]: Abstraction has has 936 places, 944 transitions, 1901 flow [2024-10-13 09:57:39,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:39,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:39,262 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:39,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:57:39,263 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:39,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:39,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1133118351, now seen corresponding path program 1 times [2024-10-13 09:57:39,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:39,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347873118] [2024-10-13 09:57:39,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:39,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:39,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:39,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347873118] [2024-10-13 09:57:39,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347873118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:39,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:39,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:39,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135366241] [2024-10-13 09:57:39,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:39,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:39,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:39,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:39,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:39,331 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1054 [2024-10-13 09:57:39,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 944 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:39,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:39,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1054 [2024-10-13 09:57:39,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:39,549 INFO L124 PetriNetUnfolderBase]: 29/1209 cut-off events. [2024-10-13 09:57:39,549 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2024-10-13 09:57:39,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 1209 events. 29/1209 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 3089 event pairs, 6 based on Foata normal form. 0/1065 useless extension candidates. Maximal degree in co-relation 1203. Up to 25 conditions per place. [2024-10-13 09:57:39,571 INFO L140 encePairwiseOnDemand]: 1051/1054 looper letters, 12 selfloop transitions, 2 changer transitions 0/943 dead transitions. [2024-10-13 09:57:39,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 943 transitions, 1927 flow [2024-10-13 09:57:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:39,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2024-10-13 09:57:39,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961100569259962 [2024-10-13 09:57:39,577 INFO L175 Difference]: Start difference. First operand has 936 places, 944 transitions, 1901 flow. Second operand 3 states and 3039 transitions. [2024-10-13 09:57:39,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 943 transitions, 1927 flow [2024-10-13 09:57:39,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 943 transitions, 1923 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:39,591 INFO L231 Difference]: Finished difference. Result has 935 places, 943 transitions, 1899 flow [2024-10-13 09:57:39,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=941, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=935, PETRI_TRANSITIONS=943} [2024-10-13 09:57:39,593 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -58 predicate places. [2024-10-13 09:57:39,594 INFO L471 AbstractCegarLoop]: Abstraction has has 935 places, 943 transitions, 1899 flow [2024-10-13 09:57:39,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:39,594 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:39,595 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:39,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:57:39,595 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:39,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:39,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1431934626, now seen corresponding path program 1 times [2024-10-13 09:57:39,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:39,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750479206] [2024-10-13 09:57:39,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:39,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:39,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:39,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:39,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750479206] [2024-10-13 09:57:39,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750479206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:39,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:39,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:39,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006614904] [2024-10-13 09:57:39,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:39,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:39,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:39,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:39,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:39,655 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1054 [2024-10-13 09:57:39,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 943 transitions, 1899 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:39,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:39,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1054 [2024-10-13 09:57:39,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:39,872 INFO L124 PetriNetUnfolderBase]: 29/1170 cut-off events. [2024-10-13 09:57:39,873 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2024-10-13 09:57:39,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 1170 events. 29/1170 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2940 event pairs, 6 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 1164. Up to 25 conditions per place. [2024-10-13 09:57:39,891 INFO L140 encePairwiseOnDemand]: 1051/1054 looper letters, 12 selfloop transitions, 2 changer transitions 0/942 dead transitions. [2024-10-13 09:57:39,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 942 transitions, 1925 flow [2024-10-13 09:57:39,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2024-10-13 09:57:39,897 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961100569259962 [2024-10-13 09:57:39,897 INFO L175 Difference]: Start difference. First operand has 935 places, 943 transitions, 1899 flow. Second operand 3 states and 3039 transitions. [2024-10-13 09:57:39,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 942 transitions, 1925 flow [2024-10-13 09:57:39,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 942 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:39,911 INFO L231 Difference]: Finished difference. Result has 934 places, 942 transitions, 1897 flow [2024-10-13 09:57:39,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=940, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1897, PETRI_PLACES=934, PETRI_TRANSITIONS=942} [2024-10-13 09:57:39,913 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -59 predicate places. [2024-10-13 09:57:39,913 INFO L471 AbstractCegarLoop]: Abstraction has has 934 places, 942 transitions, 1897 flow [2024-10-13 09:57:39,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:39,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:39,914 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:39,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:57:39,914 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:39,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:39,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1427865665, now seen corresponding path program 1 times [2024-10-13 09:57:39,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:39,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3351407] [2024-10-13 09:57:39,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:39,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:39,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:39,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3351407] [2024-10-13 09:57:39,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3351407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:39,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:39,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:57:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507998055] [2024-10-13 09:57:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:39,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:57:39,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:39,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:57:39,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:57:40,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1007 out of 1054 [2024-10-13 09:57:40,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 942 transitions, 1897 flow. Second operand has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:40,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:40,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1007 of 1054 [2024-10-13 09:57:40,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:40,399 INFO L124 PetriNetUnfolderBase]: 61/2113 cut-off events. [2024-10-13 09:57:40,399 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 09:57:40,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2185 conditions, 2113 events. 61/2113 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 10772 event pairs, 20 based on Foata normal form. 0/1818 useless extension candidates. Maximal degree in co-relation 2142. Up to 50 conditions per place. [2024-10-13 09:57:40,438 INFO L140 encePairwiseOnDemand]: 1051/1054 looper letters, 13 selfloop transitions, 2 changer transitions 0/941 dead transitions. [2024-10-13 09:57:40,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 941 transitions, 1925 flow [2024-10-13 09:57:40,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:57:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:57:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3037 transitions. [2024-10-13 09:57:40,443 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9604680581910183 [2024-10-13 09:57:40,443 INFO L175 Difference]: Start difference. First operand has 934 places, 942 transitions, 1897 flow. Second operand 3 states and 3037 transitions. [2024-10-13 09:57:40,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 941 transitions, 1925 flow [2024-10-13 09:57:40,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 941 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:57:40,458 INFO L231 Difference]: Finished difference. Result has 933 places, 941 transitions, 1895 flow [2024-10-13 09:57:40,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=931, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=941, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1895, PETRI_PLACES=933, PETRI_TRANSITIONS=941} [2024-10-13 09:57:40,459 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -60 predicate places. [2024-10-13 09:57:40,459 INFO L471 AbstractCegarLoop]: Abstraction has has 933 places, 941 transitions, 1895 flow [2024-10-13 09:57:40,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:40,460 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:57:40,460 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:57:40,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:57:40,461 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:57:40,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:57:40,461 INFO L85 PathProgramCache]: Analyzing trace with hash -624772100, now seen corresponding path program 1 times [2024-10-13 09:57:40,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:57:40,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863776112] [2024-10-13 09:57:40,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:57:40,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:57:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:57:41,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:57:41,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:57:41,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863776112] [2024-10-13 09:57:41,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863776112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:57:41,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:57:41,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:57:41,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924133102] [2024-10-13 09:57:41,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:57:41,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:57:41,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:57:41,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:57:41,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:57:41,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 919 out of 1054 [2024-10-13 09:57:41,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 941 transitions, 1895 flow. Second operand has 6 states, 6 states have (on average 920.5) internal successors, (5523), 6 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:57:41,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:57:41,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 919 of 1054 [2024-10-13 09:57:41,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:57:59,375 INFO L124 PetriNetUnfolderBase]: 15256/84667 cut-off events. [2024-10-13 09:57:59,376 INFO L125 PetriNetUnfolderBase]: For 719/719 co-relation queries the response was YES. [2024-10-13 09:57:59,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107096 conditions, 84667 events. 15256/84667 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 1249806 event pairs, 14040 based on Foata normal form. 0/73980 useless extension candidates. Maximal degree in co-relation 107054. Up to 22026 conditions per place. [2024-10-13 09:58:00,018 INFO L140 encePairwiseOnDemand]: 1036/1054 looper letters, 87 selfloop transitions, 15 changer transitions 0/938 dead transitions. [2024-10-13 09:58:00,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 938 transitions, 2093 flow [2024-10-13 09:58:00,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:58:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 09:58:00,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5619 transitions. [2024-10-13 09:58:00,026 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8885199240986718 [2024-10-13 09:58:00,026 INFO L175 Difference]: Start difference. First operand has 933 places, 941 transitions, 1895 flow. Second operand 6 states and 5619 transitions. [2024-10-13 09:58:00,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 938 transitions, 2093 flow [2024-10-13 09:58:00,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 938 transitions, 2089 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:00,041 INFO L231 Difference]: Finished difference. Result has 933 places, 938 transitions, 1915 flow [2024-10-13 09:58:00,042 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=923, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1915, PETRI_PLACES=933, PETRI_TRANSITIONS=938} [2024-10-13 09:58:00,042 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -60 predicate places. [2024-10-13 09:58:00,042 INFO L471 AbstractCegarLoop]: Abstraction has has 933 places, 938 transitions, 1915 flow [2024-10-13 09:58:00,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 920.5) internal successors, (5523), 6 states have internal predecessors, (5523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:00,044 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:00,044 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:00,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:58:00,045 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:58:00,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:00,045 INFO L85 PathProgramCache]: Analyzing trace with hash 291472292, now seen corresponding path program 1 times [2024-10-13 09:58:00,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:00,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137717754] [2024-10-13 09:58:00,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:00,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:00,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:00,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137717754] [2024-10-13 09:58:00,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137717754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:00,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:00,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:00,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516019395] [2024-10-13 09:58:00,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:00,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:00,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:00,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:00,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:00,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1007 out of 1054 [2024-10-13 09:58:00,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 938 transitions, 1915 flow. Second operand has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:00,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:00,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1007 of 1054 [2024-10-13 09:58:00,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:00,430 INFO L124 PetriNetUnfolderBase]: 47/1835 cut-off events. [2024-10-13 09:58:00,430 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2024-10-13 09:58:00,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1902 conditions, 1835 events. 47/1835 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 7498 event pairs, 12 based on Foata normal form. 0/1592 useless extension candidates. Maximal degree in co-relation 1859. Up to 38 conditions per place. [2024-10-13 09:58:00,464 INFO L140 encePairwiseOnDemand]: 1051/1054 looper letters, 13 selfloop transitions, 2 changer transitions 0/937 dead transitions. [2024-10-13 09:58:00,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 934 places, 937 transitions, 1943 flow [2024-10-13 09:58:00,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:00,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3037 transitions. [2024-10-13 09:58:00,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9604680581910183 [2024-10-13 09:58:00,467 INFO L175 Difference]: Start difference. First operand has 933 places, 938 transitions, 1915 flow. Second operand 3 states and 3037 transitions. [2024-10-13 09:58:00,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 934 places, 937 transitions, 1943 flow [2024-10-13 09:58:00,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 937 transitions, 1913 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 09:58:00,482 INFO L231 Difference]: Finished difference. Result has 929 places, 937 transitions, 1887 flow [2024-10-13 09:58:00,484 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=937, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1887, PETRI_PLACES=929, PETRI_TRANSITIONS=937} [2024-10-13 09:58:00,484 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -64 predicate places. [2024-10-13 09:58:00,484 INFO L471 AbstractCegarLoop]: Abstraction has has 929 places, 937 transitions, 1887 flow [2024-10-13 09:58:00,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:00,486 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:00,486 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:00,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:58:00,486 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:58:00,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:00,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1613090026, now seen corresponding path program 1 times [2024-10-13 09:58:00,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:00,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371241231] [2024-10-13 09:58:00,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:00,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:00,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371241231] [2024-10-13 09:58:00,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371241231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:00,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:00,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:00,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835642847] [2024-10-13 09:58:00,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:00,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:00,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:00,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:00,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:00,591 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1007 out of 1054 [2024-10-13 09:58:00,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 937 transitions, 1887 flow. Second operand has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:00,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:00,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1007 of 1054 [2024-10-13 09:58:00,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:01,120 INFO L124 PetriNetUnfolderBase]: 52/1631 cut-off events. [2024-10-13 09:58:01,120 INFO L125 PetriNetUnfolderBase]: For 12/24 co-relation queries the response was YES. [2024-10-13 09:58:01,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 1631 events. 52/1631 cut-off events. For 12/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6140 event pairs, 20 based on Foata normal form. 0/1424 useless extension candidates. Maximal degree in co-relation 1652. Up to 50 conditions per place. [2024-10-13 09:58:01,144 INFO L140 encePairwiseOnDemand]: 1051/1054 looper letters, 13 selfloop transitions, 2 changer transitions 0/936 dead transitions. [2024-10-13 09:58:01,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 936 transitions, 1915 flow [2024-10-13 09:58:01,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3037 transitions. [2024-10-13 09:58:01,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9604680581910183 [2024-10-13 09:58:01,148 INFO L175 Difference]: Start difference. First operand has 929 places, 937 transitions, 1887 flow. Second operand 3 states and 3037 transitions. [2024-10-13 09:58:01,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 936 transitions, 1915 flow [2024-10-13 09:58:01,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 936 transitions, 1911 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:01,157 INFO L231 Difference]: Finished difference. Result has 928 places, 936 transitions, 1885 flow [2024-10-13 09:58:01,159 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1881, PETRI_DIFFERENCE_MINUEND_PLACES=926, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=934, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1885, PETRI_PLACES=928, PETRI_TRANSITIONS=936} [2024-10-13 09:58:01,159 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -65 predicate places. [2024-10-13 09:58:01,159 INFO L471 AbstractCegarLoop]: Abstraction has has 928 places, 936 transitions, 1885 flow [2024-10-13 09:58:01,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:01,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:01,160 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:01,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 09:58:01,160 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:58:01,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:01,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2120768922, now seen corresponding path program 1 times [2024-10-13 09:58:01,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:01,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848845737] [2024-10-13 09:58:01,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:01,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:01,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:01,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848845737] [2024-10-13 09:58:01,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848845737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:01,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:01,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:01,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160963301] [2024-10-13 09:58:01,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:01,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:01,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:01,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:01,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:01,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 919 out of 1054 [2024-10-13 09:58:01,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 936 transitions, 1885 flow. Second operand has 3 states, 3 states have (on average 921.0) internal successors, (2763), 3 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:01,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:01,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 919 of 1054 [2024-10-13 09:58:01,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:17,821 INFO L124 PetriNetUnfolderBase]: 15256/84662 cut-off events. [2024-10-13 09:58:17,822 INFO L125 PetriNetUnfolderBase]: For 719/719 co-relation queries the response was YES. [2024-10-13 09:58:18,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107091 conditions, 84662 events. 15256/84662 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 1250531 event pairs, 14040 based on Foata normal form. 0/73980 useless extension candidates. Maximal degree in co-relation 107049. Up to 22035 conditions per place. [2024-10-13 09:58:18,727 INFO L140 encePairwiseOnDemand]: 1045/1054 looper letters, 96 selfloop transitions, 6 changer transitions 0/933 dead transitions. [2024-10-13 09:58:18,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 927 places, 933 transitions, 2083 flow [2024-10-13 09:58:18,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:18,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2862 transitions. [2024-10-13 09:58:18,732 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.905123339658444 [2024-10-13 09:58:18,732 INFO L175 Difference]: Start difference. First operand has 928 places, 936 transitions, 1885 flow. Second operand 3 states and 2862 transitions. [2024-10-13 09:58:18,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 927 places, 933 transitions, 2083 flow [2024-10-13 09:58:18,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 925 places, 933 transitions, 2079 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:58:18,744 INFO L231 Difference]: Finished difference. Result has 925 places, 933 transitions, 1887 flow [2024-10-13 09:58:18,745 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1054, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=927, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1887, PETRI_PLACES=925, PETRI_TRANSITIONS=933} [2024-10-13 09:58:18,746 INFO L277 CegarLoopForPetriNet]: 993 programPoint places, -68 predicate places. [2024-10-13 09:58:18,746 INFO L471 AbstractCegarLoop]: Abstraction has has 925 places, 933 transitions, 1887 flow [2024-10-13 09:58:18,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 921.0) internal successors, (2763), 3 states have internal predecessors, (2763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:18,747 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:58:18,747 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:58:18,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 09:58:18,747 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2024-10-13 09:58:18,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:58:18,748 INFO L85 PathProgramCache]: Analyzing trace with hash 369564508, now seen corresponding path program 1 times [2024-10-13 09:58:18,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:58:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665080535] [2024-10-13 09:58:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:58:18,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:58:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:58:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:58:18,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:58:18,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665080535] [2024-10-13 09:58:18,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665080535] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:58:18,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:58:18,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:58:18,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337447871] [2024-10-13 09:58:18,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:58:18,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:58:18,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:58:18,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:58:18,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:58:18,852 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1009 out of 1054 [2024-10-13 09:58:18,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 925 places, 933 transitions, 1887 flow. Second operand has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 09:58:18,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:58:18,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1009 of 1054 [2024-10-13 09:58:18,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:58:19,165 INFO L124 PetriNetUnfolderBase]: 36/1535 cut-off events. [2024-10-13 09:58:19,166 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-13 09:58:19,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 1535 events. 36/1535 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5800 event pairs, 7 based on Foata normal form. 0/1349 useless extension candidates. Maximal degree in co-relation 1550. Up to 25 conditions per place. [2024-10-13 09:58:19,189 INFO L140 encePairwiseOnDemand]: 1051/1054 looper letters, 11 selfloop transitions, 2 changer transitions 0/932 dead transitions. [2024-10-13 09:58:19,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 926 places, 932 transitions, 1911 flow [2024-10-13 09:58:19,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:58:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:58:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3041 transitions. [2024-10-13 09:58:19,194 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9617330803289058 [2024-10-13 09:58:19,194 INFO L175 Difference]: Start difference. First operand has 925 places, 933 transitions, 1887 flow. Second operand 3 states and 3041 transitions. [2024-10-13 09:58:19,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 926 places, 932 transitions, 1911 flow [2024-10-13 09:58:19,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 932 transitions, 1899 flow, removed 0 selfloop flow, removed 2 redundant places.