./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i -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 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:55:37,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:55:37,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:55:37,642 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:55:37,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:55:37,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:55:37,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:55:37,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:55:37,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:55:37,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:55:37,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:55:37,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:55:37,656 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:55:37,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:55:37,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:55:37,657 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:55:37,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:55:37,657 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:55:37,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:55:37,658 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:55:37,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:55:37,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:55:37,662 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:55:37,663 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:55:37,663 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:55:37,663 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:55:37,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:55:37,663 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:55:37,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:55:37,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:55:37,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:55:37,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:55:37,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:55:37,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:55:37,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:55:37,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:55:37,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:55:37,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:55:37,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:55:37,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:55:37,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:55:37,670 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 -> 4e91816f101a416d37c086dd7185cfb4e2bfa63eb286e4a418cb94db27cf2f6f [2024-11-09 06:55:37,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:55:37,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:55:37,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:55:37,877 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:55:37,877 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:55:37,878 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2024-11-09 06:55:39,085 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:55:39,307 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:55:39,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_20-callback_racefree.i [2024-11-09 06:55:39,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da6eb7c14/c4231da578574275a97760565ac03637/FLAGd815124ae [2024-11-09 06:55:39,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da6eb7c14/c4231da578574275a97760565ac03637 [2024-11-09 06:55:39,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:55:39,330 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:55:39,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:55:39,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:55:39,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:55:39,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:55:39" (1/1) ... [2024-11-09 06:55:39,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa8c9dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:39, skipping insertion in model container [2024-11-09 06:55:39,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:55:39" (1/1) ... [2024-11-09 06:55:39,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:55:39,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:55:39,658 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:55:39,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:55:39,741 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:55:39,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:39 WrapperNode [2024-11-09 06:55:39,742 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:55:39,743 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:55:39,743 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:55:39,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:55:39,749 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:39" (1/1) ... [2024-11-09 06:55:39,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:39" (1/1) ... [2024-11-09 06:55:39,792 INFO L138 Inliner]: procedures = 174, calls = 39, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 222 [2024-11-09 06:55:39,793 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:55:39,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:55:39,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:55:39,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:55:39,803 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:39" (1/1) ... [2024-11-09 06:55:39,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:39" (1/1) ... [2024-11-09 06:55:39,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:39" (1/1) ... [2024-11-09 06:55:39,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:39" (1/1) ... [2024-11-09 06:55:39,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:39" (1/1) ... [2024-11-09 06:55:39,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:39" (1/1) ... [2024-11-09 06:55:39,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:39" (1/1) ... [2024-11-09 06:55:39,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:39" (1/1) ... [2024-11-09 06:55:39,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:55:39,822 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:55:39,822 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:55:39,823 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:55:39,824 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:39" (1/1) ... [2024-11-09 06:55:39,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:55:39,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:55:39,854 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 06:55:39,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 06:55:39,889 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:55:39,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:55:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 06:55:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:55:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:55:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 06:55:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 06:55:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:55:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:55:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 06:55:39,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:55:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:55:39,891 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:55:39,997 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:55:39,998 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:55:40,241 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:55:40,241 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:55:40,268 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:55:40,268 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-09 06:55:40,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:55:40 BoogieIcfgContainer [2024-11-09 06:55:40,269 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:55:40,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:55:40,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:55:40,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:55:40,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:55:39" (1/3) ... [2024-11-09 06:55:40,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c986ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:55:40, skipping insertion in model container [2024-11-09 06:55:40,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:39" (2/3) ... [2024-11-09 06:55:40,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c986ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:55:40, skipping insertion in model container [2024-11-09 06:55:40,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:55:40" (3/3) ... [2024-11-09 06:55:40,281 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_20-callback_racefree.i [2024-11-09 06:55:40,293 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:55:40,293 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-09 06:55:40,293 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:55:40,337 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 06:55:40,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 231 transitions, 469 flow [2024-11-09 06:55:40,491 INFO L124 PetriNetUnfolderBase]: 27/341 cut-off events. [2024-11-09 06:55:40,491 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:55:40,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 341 events. 27/341 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 965 event pairs, 0 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 192. Up to 6 conditions per place. [2024-11-09 06:55:40,499 INFO L82 GeneralOperation]: Start removeDead. Operand has 218 places, 231 transitions, 469 flow [2024-11-09 06:55:40,505 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 218 places, 231 transitions, 469 flow [2024-11-09 06:55:40,512 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:55:40,517 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;@4375a7e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:55:40,517 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-09 06:55:40,534 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:55:40,534 INFO L124 PetriNetUnfolderBase]: 2/105 cut-off events. [2024-11-09 06:55:40,534 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:55:40,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:40,535 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] [2024-11-09 06:55:40,535 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:55:40,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:40,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1738818234, now seen corresponding path program 1 times [2024-11-09 06:55:40,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:40,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462271413] [2024-11-09 06:55:40,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:40,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:41,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:41,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462271413] [2024-11-09 06:55:41,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462271413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:41,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:41,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:55:41,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497421035] [2024-11-09 06:55:41,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:41,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:55:41,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:41,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:55:41,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:55:41,487 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 231 [2024-11-09 06:55:41,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 231 transitions, 469 flow. Second operand has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:41,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:41,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 231 [2024-11-09 06:55:41,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:41,717 INFO L124 PetriNetUnfolderBase]: 93/831 cut-off events. [2024-11-09 06:55:41,717 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:55:41,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 831 events. 93/831 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4394 event pairs, 33 based on Foata normal form. 101/872 useless extension candidates. Maximal degree in co-relation 826. Up to 154 conditions per place. [2024-11-09 06:55:41,727 INFO L140 encePairwiseOnDemand]: 212/231 looper letters, 40 selfloop transitions, 5 changer transitions 0/231 dead transitions. [2024-11-09 06:55:41,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 231 transitions, 559 flow [2024-11-09 06:55:41,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:55:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:55:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1197 transitions. [2024-11-09 06:55:41,744 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8636363636363636 [2024-11-09 06:55:41,746 INFO L175 Difference]: Start difference. First operand has 218 places, 231 transitions, 469 flow. Second operand 6 states and 1197 transitions. [2024-11-09 06:55:41,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 231 transitions, 559 flow [2024-11-09 06:55:41,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 231 transitions, 559 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:55:41,753 INFO L231 Difference]: Finished difference. Result has 220 places, 215 transitions, 447 flow [2024-11-09 06:55:41,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=447, PETRI_PLACES=220, PETRI_TRANSITIONS=215} [2024-11-09 06:55:41,760 INFO L277 CegarLoopForPetriNet]: 218 programPoint places, 2 predicate places. [2024-11-09 06:55:41,760 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 215 transitions, 447 flow [2024-11-09 06:55:41,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 188.5) internal successors, (1131), 6 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:41,761 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:41,762 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] [2024-11-09 06:55:41,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:55:41,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:55:41,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:41,765 INFO L85 PathProgramCache]: Analyzing trace with hash -385128991, now seen corresponding path program 1 times [2024-11-09 06:55:41,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:41,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815541126] [2024-11-09 06:55:41,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:41,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:41,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:41,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815541126] [2024-11-09 06:55:41,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815541126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:41,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:41,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:41,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782112661] [2024-11-09 06:55:41,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:41,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:41,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:41,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:41,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:41,861 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 231 [2024-11-09 06:55:41,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 215 transitions, 447 flow. Second operand has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:41,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:41,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 231 [2024-11-09 06:55:41,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:41,987 INFO L124 PetriNetUnfolderBase]: 113/976 cut-off events. [2024-11-09 06:55:41,987 INFO L125 PetriNetUnfolderBase]: For 13/19 co-relation queries the response was YES. [2024-11-09 06:55:41,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 976 events. 113/976 cut-off events. For 13/19 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4857 event pairs, 34 based on Foata normal form. 1/899 useless extension candidates. Maximal degree in co-relation 1029. Up to 137 conditions per place. [2024-11-09 06:55:41,993 INFO L140 encePairwiseOnDemand]: 222/231 looper letters, 30 selfloop transitions, 6 changer transitions 0/228 dead transitions. [2024-11-09 06:55:41,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 228 transitions, 548 flow [2024-11-09 06:55:41,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 621 transitions. [2024-11-09 06:55:41,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8961038961038961 [2024-11-09 06:55:41,995 INFO L175 Difference]: Start difference. First operand has 220 places, 215 transitions, 447 flow. Second operand 3 states and 621 transitions. [2024-11-09 06:55:41,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 228 transitions, 548 flow [2024-11-09 06:55:41,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 228 transitions, 538 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:55:42,001 INFO L231 Difference]: Finished difference. Result has 217 places, 217 transitions, 475 flow [2024-11-09 06:55:42,003 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=475, PETRI_PLACES=217, PETRI_TRANSITIONS=217} [2024-11-09 06:55:42,004 INFO L277 CegarLoopForPetriNet]: 218 programPoint places, -1 predicate places. [2024-11-09 06:55:42,004 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 217 transitions, 475 flow [2024-11-09 06:55:42,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:42,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:42,005 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] [2024-11-09 06:55:42,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:55:42,006 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:55:42,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:42,007 INFO L85 PathProgramCache]: Analyzing trace with hash 442208826, now seen corresponding path program 1 times [2024-11-09 06:55:42,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:42,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607130465] [2024-11-09 06:55:42,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:42,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:42,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:42,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:42,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607130465] [2024-11-09 06:55:42,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607130465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:42,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:42,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:55:42,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962485882] [2024-11-09 06:55:42,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:42,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:42,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:42,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:42,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:42,114 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 231 [2024-11-09 06:55:42,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 217 transitions, 475 flow. Second operand has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:42,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:42,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 231 [2024-11-09 06:55:42,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:42,218 INFO L124 PetriNetUnfolderBase]: 86/1080 cut-off events. [2024-11-09 06:55:42,219 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-09 06:55:42,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 1080 events. 86/1080 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5630 event pairs, 10 based on Foata normal form. 1/1010 useless extension candidates. Maximal degree in co-relation 1175. Up to 144 conditions per place. [2024-11-09 06:55:42,226 INFO L140 encePairwiseOnDemand]: 228/231 looper letters, 20 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2024-11-09 06:55:42,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 221 transitions, 527 flow [2024-11-09 06:55:42,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:42,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2024-11-09 06:55:42,228 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8946608946608947 [2024-11-09 06:55:42,228 INFO L175 Difference]: Start difference. First operand has 217 places, 217 transitions, 475 flow. Second operand 3 states and 620 transitions. [2024-11-09 06:55:42,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 221 transitions, 527 flow [2024-11-09 06:55:42,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 221 transitions, 515 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:55:42,232 INFO L231 Difference]: Finished difference. Result has 218 places, 217 transitions, 471 flow [2024-11-09 06:55:42,233 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=218, PETRI_TRANSITIONS=217} [2024-11-09 06:55:42,234 INFO L277 CegarLoopForPetriNet]: 218 programPoint places, 0 predicate places. [2024-11-09 06:55:42,234 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 217 transitions, 471 flow [2024-11-09 06:55:42,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.33333333333334) internal successors, (601), 3 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:42,235 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:42,235 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:42,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:55:42,237 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:55:42,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:42,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1971312654, now seen corresponding path program 1 times [2024-11-09 06:55:42,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:42,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54005415] [2024-11-09 06:55:42,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:42,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:42,272 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:55:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:42,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:55:42,313 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:55:42,313 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-09 06:55:42,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-09 06:55:42,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-09 06:55:42,315 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-09 06:55:42,316 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-09 06:55:42,318 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-09 06:55:42,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-09 06:55:42,319 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-09 06:55:42,320 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-09 06:55:42,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:55:42,320 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 06:55:42,322 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 06:55:42,323 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 06:55:42,347 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 06:55:42,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 247 places, 263 transitions, 542 flow [2024-11-09 06:55:42,398 INFO L124 PetriNetUnfolderBase]: 45/511 cut-off events. [2024-11-09 06:55:42,398 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 06:55:42,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 511 events. 45/511 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1846 event pairs, 0 based on Foata normal form. 0/441 useless extension candidates. Maximal degree in co-relation 343. Up to 9 conditions per place. [2024-11-09 06:55:42,402 INFO L82 GeneralOperation]: Start removeDead. Operand has 247 places, 263 transitions, 542 flow [2024-11-09 06:55:42,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 247 places, 263 transitions, 542 flow [2024-11-09 06:55:42,407 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:55:42,408 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;@4375a7e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:55:42,409 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-09 06:55:42,414 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:55:42,414 INFO L124 PetriNetUnfolderBase]: 2/105 cut-off events. [2024-11-09 06:55:42,414 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:55:42,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:42,415 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:42,415 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-09 06:55:42,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:42,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1874739962, now seen corresponding path program 1 times [2024-11-09 06:55:42,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:42,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206171217] [2024-11-09 06:55:42,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:42,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:42,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:42,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206171217] [2024-11-09 06:55:42,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206171217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:42,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:42,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:55:42,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673244394] [2024-11-09 06:55:42,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:42,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:55:42,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:42,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:55:42,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:55:42,829 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 263 [2024-11-09 06:55:42,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 263 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:42,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:42,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 263 [2024-11-09 06:55:42,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:43,313 INFO L124 PetriNetUnfolderBase]: 1001/4650 cut-off events. [2024-11-09 06:55:43,314 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-09 06:55:43,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6309 conditions, 4650 events. 1001/4650 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 43045 event pairs, 108 based on Foata normal form. 915/5232 useless extension candidates. Maximal degree in co-relation 1068. Up to 1202 conditions per place. [2024-11-09 06:55:43,369 INFO L140 encePairwiseOnDemand]: 240/263 looper letters, 62 selfloop transitions, 5 changer transitions 0/273 dead transitions. [2024-11-09 06:55:43,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 273 transitions, 696 flow [2024-11-09 06:55:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:55:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:55:43,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1365 transitions. [2024-11-09 06:55:43,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8650190114068441 [2024-11-09 06:55:43,373 INFO L175 Difference]: Start difference. First operand has 247 places, 263 transitions, 542 flow. Second operand 6 states and 1365 transitions. [2024-11-09 06:55:43,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 273 transitions, 696 flow [2024-11-09 06:55:43,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 273 transitions, 696 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:55:43,377 INFO L231 Difference]: Finished difference. Result has 247 places, 241 transitions, 508 flow [2024-11-09 06:55:43,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=508, PETRI_PLACES=247, PETRI_TRANSITIONS=241} [2024-11-09 06:55:43,379 INFO L277 CegarLoopForPetriNet]: 247 programPoint places, 0 predicate places. [2024-11-09 06:55:43,379 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 241 transitions, 508 flow [2024-11-09 06:55:43,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 209.5) internal successors, (1257), 6 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:43,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:43,380 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] [2024-11-09 06:55:43,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:55:43,380 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-09 06:55:43,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:43,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1430297539, now seen corresponding path program 1 times [2024-11-09 06:55:43,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:43,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90669277] [2024-11-09 06:55:43,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:43,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:43,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:43,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:43,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90669277] [2024-11-09 06:55:43,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90669277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:43,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:43,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:43,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151500661] [2024-11-09 06:55:43,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:43,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:43,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:43,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:43,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:43,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 263 [2024-11-09 06:55:43,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 241 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:43,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:43,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 263 [2024-11-09 06:55:43,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:44,388 INFO L124 PetriNetUnfolderBase]: 2103/8752 cut-off events. [2024-11-09 06:55:44,389 INFO L125 PetriNetUnfolderBase]: For 271/398 co-relation queries the response was YES. [2024-11-09 06:55:44,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12276 conditions, 8752 events. 2103/8752 cut-off events. For 271/398 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 86428 event pairs, 747 based on Foata normal form. 8/7949 useless extension candidates. Maximal degree in co-relation 10983. Up to 2127 conditions per place. [2024-11-09 06:55:44,431 INFO L140 encePairwiseOnDemand]: 251/263 looper letters, 45 selfloop transitions, 8 changer transitions 0/262 dead transitions. [2024-11-09 06:55:44,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 262 transitions, 667 flow [2024-11-09 06:55:44,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:44,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 693 transitions. [2024-11-09 06:55:44,433 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8783269961977186 [2024-11-09 06:55:44,433 INFO L175 Difference]: Start difference. First operand has 247 places, 241 transitions, 508 flow. Second operand 3 states and 693 transitions. [2024-11-09 06:55:44,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 262 transitions, 667 flow [2024-11-09 06:55:44,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 262 transitions, 657 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:55:44,439 INFO L231 Difference]: Finished difference. Result has 244 places, 245 transitions, 554 flow [2024-11-09 06:55:44,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=244, PETRI_TRANSITIONS=245} [2024-11-09 06:55:44,440 INFO L277 CegarLoopForPetriNet]: 247 programPoint places, -3 predicate places. [2024-11-09 06:55:44,441 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 245 transitions, 554 flow [2024-11-09 06:55:44,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:44,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:44,441 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] [2024-11-09 06:55:44,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:55:44,442 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-09 06:55:44,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:44,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1512932858, now seen corresponding path program 1 times [2024-11-09 06:55:44,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:44,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817147180] [2024-11-09 06:55:44,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:44,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:44,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:44,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:44,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817147180] [2024-11-09 06:55:44,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817147180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:44,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:44,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:55:44,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589281160] [2024-11-09 06:55:44,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:44,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:44,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:44,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:44,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:44,513 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 263 [2024-11-09 06:55:44,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 245 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:44,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:44,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 263 [2024-11-09 06:55:44,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:45,243 INFO L124 PetriNetUnfolderBase]: 1320/7689 cut-off events. [2024-11-09 06:55:45,243 INFO L125 PetriNetUnfolderBase]: For 412/458 co-relation queries the response was YES. [2024-11-09 06:55:45,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10499 conditions, 7689 events. 1320/7689 cut-off events. For 412/458 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 78404 event pairs, 566 based on Foata normal form. 1/7029 useless extension candidates. Maximal degree in co-relation 4494. Up to 1811 conditions per place. [2024-11-09 06:55:45,274 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 27 selfloop transitions, 2 changer transitions 0/250 dead transitions. [2024-11-09 06:55:45,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 250 transitions, 622 flow [2024-11-09 06:55:45,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2024-11-09 06:55:45,276 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8745247148288974 [2024-11-09 06:55:45,276 INFO L175 Difference]: Start difference. First operand has 244 places, 245 transitions, 554 flow. Second operand 3 states and 690 transitions. [2024-11-09 06:55:45,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 250 transitions, 622 flow [2024-11-09 06:55:45,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 250 transitions, 606 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:55:45,283 INFO L231 Difference]: Finished difference. Result has 245 places, 246 transitions, 550 flow [2024-11-09 06:55:45,283 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=245, PETRI_TRANSITIONS=246} [2024-11-09 06:55:45,285 INFO L277 CegarLoopForPetriNet]: 247 programPoint places, -2 predicate places. [2024-11-09 06:55:45,285 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 246 transitions, 550 flow [2024-11-09 06:55:45,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:45,285 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:45,286 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] [2024-11-09 06:55:45,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:55:45,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-09 06:55:45,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:45,286 INFO L85 PathProgramCache]: Analyzing trace with hash 385168878, now seen corresponding path program 1 times [2024-11-09 06:55:45,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:45,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828337855] [2024-11-09 06:55:45,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:45,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:45,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:45,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:45,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:45,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828337855] [2024-11-09 06:55:45,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828337855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:55:45,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807605761] [2024-11-09 06:55:45,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:45,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:55:45,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:55:45,356 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:55:45,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 06:55:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:45,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 06:55:45,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:55:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:55:45,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:55:45,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807605761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:45,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:55:45,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 06:55:45,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201288404] [2024-11-09 06:55:45,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:45,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:45,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:45,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:45,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:55:45,493 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 263 [2024-11-09 06:55:45,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 246 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:45,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:45,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 263 [2024-11-09 06:55:45,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:46,761 INFO L124 PetriNetUnfolderBase]: 2343/13241 cut-off events. [2024-11-09 06:55:46,761 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-11-09 06:55:46,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17743 conditions, 13241 events. 2343/13241 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 154891 event pairs, 1363 based on Foata normal form. 36/12154 useless extension candidates. Maximal degree in co-relation 17635. Up to 2189 conditions per place. [2024-11-09 06:55:46,836 INFO L140 encePairwiseOnDemand]: 260/263 looper letters, 37 selfloop transitions, 2 changer transitions 0/261 dead transitions. [2024-11-09 06:55:46,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 261 transitions, 658 flow [2024-11-09 06:55:46,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:46,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2024-11-09 06:55:46,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8871989860583016 [2024-11-09 06:55:46,840 INFO L175 Difference]: Start difference. First operand has 245 places, 246 transitions, 550 flow. Second operand 3 states and 700 transitions. [2024-11-09 06:55:46,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 261 transitions, 658 flow [2024-11-09 06:55:46,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 261 transitions, 656 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:55:46,847 INFO L231 Difference]: Finished difference. Result has 247 places, 247 transitions, 560 flow [2024-11-09 06:55:46,849 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=263, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=247, PETRI_TRANSITIONS=247} [2024-11-09 06:55:46,850 INFO L277 CegarLoopForPetriNet]: 247 programPoint places, 0 predicate places. [2024-11-09 06:55:46,850 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 247 transitions, 560 flow [2024-11-09 06:55:46,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:46,852 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:46,852 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:46,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 06:55:47,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:55:47,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-09 06:55:47,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:47,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1048926782, now seen corresponding path program 1 times [2024-11-09 06:55:47,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:47,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880643888] [2024-11-09 06:55:47,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:47,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:47,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:55:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:47,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:55:47,133 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:55:47,133 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-09 06:55:47,133 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-09 06:55:47,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-09 06:55:47,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-09 06:55:47,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-09 06:55:47,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-09 06:55:47,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-09 06:55:47,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-09 06:55:47,134 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-09 06:55:47,135 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-09 06:55:47,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:55:47,135 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 06:55:47,136 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 06:55:47,136 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 06:55:47,158 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 06:55:47,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 276 places, 295 transitions, 617 flow [2024-11-09 06:55:47,239 INFO L124 PetriNetUnfolderBase]: 68/726 cut-off events. [2024-11-09 06:55:47,239 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 06:55:47,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 726 events. 68/726 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2924 event pairs, 1 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 519. Up to 16 conditions per place. [2024-11-09 06:55:47,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 276 places, 295 transitions, 617 flow [2024-11-09 06:55:47,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 276 places, 295 transitions, 617 flow [2024-11-09 06:55:47,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:55:47,247 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;@4375a7e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:55:47,247 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-09 06:55:47,254 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:55:47,254 INFO L124 PetriNetUnfolderBase]: 2/105 cut-off events. [2024-11-09 06:55:47,254 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:55:47,254 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:47,255 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] [2024-11-09 06:55:47,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 06:55:47,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:47,255 INFO L85 PathProgramCache]: Analyzing trace with hash 394132282, now seen corresponding path program 1 times [2024-11-09 06:55:47,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:47,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537801612] [2024-11-09 06:55:47,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:47,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:47,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:47,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537801612] [2024-11-09 06:55:47,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537801612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:47,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:47,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:55:47,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783084578] [2024-11-09 06:55:47,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:47,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:55:47,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:47,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:55:47,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:55:47,828 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 295 [2024-11-09 06:55:47,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 295 transitions, 617 flow. Second operand has 6 states, 6 states have (on average 230.5) internal successors, (1383), 6 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:47,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:47,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 295 [2024-11-09 06:55:47,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:50,458 INFO L124 PetriNetUnfolderBase]: 8120/27179 cut-off events. [2024-11-09 06:55:50,459 INFO L125 PetriNetUnfolderBase]: For 557/557 co-relation queries the response was YES. [2024-11-09 06:55:50,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38914 conditions, 27179 events. 8120/27179 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 748. Compared 327880 event pairs, 710 based on Foata normal form. 6819/32198 useless extension candidates. Maximal degree in co-relation 6339. Up to 8631 conditions per place. [2024-11-09 06:55:50,579 INFO L140 encePairwiseOnDemand]: 268/295 looper letters, 84 selfloop transitions, 5 changer transitions 0/315 dead transitions. [2024-11-09 06:55:50,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 315 transitions, 835 flow [2024-11-09 06:55:50,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:55:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:55:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1533 transitions. [2024-11-09 06:55:50,583 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8661016949152542 [2024-11-09 06:55:50,583 INFO L175 Difference]: Start difference. First operand has 276 places, 295 transitions, 617 flow. Second operand 6 states and 1533 transitions. [2024-11-09 06:55:50,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 315 transitions, 835 flow [2024-11-09 06:55:50,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 315 transitions, 835 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:55:50,587 INFO L231 Difference]: Finished difference. Result has 274 places, 267 transitions, 571 flow [2024-11-09 06:55:50,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=571, PETRI_PLACES=274, PETRI_TRANSITIONS=267} [2024-11-09 06:55:50,588 INFO L277 CegarLoopForPetriNet]: 276 programPoint places, -2 predicate places. [2024-11-09 06:55:50,588 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 267 transitions, 571 flow [2024-11-09 06:55:50,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 230.5) internal successors, (1383), 6 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:50,589 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:50,589 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] [2024-11-09 06:55:50,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:55:50,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 06:55:50,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:50,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1124076703, now seen corresponding path program 1 times [2024-11-09 06:55:50,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:50,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802695188] [2024-11-09 06:55:50,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:50,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:50,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:50,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:50,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802695188] [2024-11-09 06:55:50,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802695188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:50,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:50,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:50,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288090530] [2024-11-09 06:55:50,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:50,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:50,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:50,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:50,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:50,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 295 [2024-11-09 06:55:50,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 267 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:50,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:50,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 295 [2024-11-09 06:55:50,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:59,062 INFO L124 PetriNetUnfolderBase]: 27267/82271 cut-off events. [2024-11-09 06:55:59,063 INFO L125 PetriNetUnfolderBase]: For 2763/4664 co-relation queries the response was YES. [2024-11-09 06:55:59,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121909 conditions, 82271 events. 27267/82271 cut-off events. For 2763/4664 co-relation queries the response was YES. Maximal size of possible extension queue 1760. Compared 1093743 event pairs, 10774 based on Foata normal form. 32/74598 useless extension candidates. Maximal degree in co-relation 109328. Up to 25188 conditions per place. [2024-11-09 06:55:59,512 INFO L140 encePairwiseOnDemand]: 280/295 looper letters, 60 selfloop transitions, 10 changer transitions 0/296 dead transitions. [2024-11-09 06:55:59,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 296 transitions, 790 flow [2024-11-09 06:55:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 765 transitions. [2024-11-09 06:55:59,515 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.864406779661017 [2024-11-09 06:55:59,515 INFO L175 Difference]: Start difference. First operand has 274 places, 267 transitions, 571 flow. Second operand 3 states and 765 transitions. [2024-11-09 06:55:59,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 296 transitions, 790 flow [2024-11-09 06:55:59,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 296 transitions, 780 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:55:59,521 INFO L231 Difference]: Finished difference. Result has 271 places, 273 transitions, 635 flow [2024-11-09 06:55:59,522 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=635, PETRI_PLACES=271, PETRI_TRANSITIONS=273} [2024-11-09 06:55:59,522 INFO L277 CegarLoopForPetriNet]: 276 programPoint places, -5 predicate places. [2024-11-09 06:55:59,522 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 273 transitions, 635 flow [2024-11-09 06:55:59,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:59,523 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:59,523 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] [2024-11-09 06:55:59,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:55:59,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 06:55:59,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:59,524 INFO L85 PathProgramCache]: Analyzing trace with hash -976797254, now seen corresponding path program 1 times [2024-11-09 06:55:59,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:59,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230932217] [2024-11-09 06:55:59,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:59,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:59,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:59,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:59,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230932217] [2024-11-09 06:55:59,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230932217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:59,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:59,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:55:59,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337980592] [2024-11-09 06:55:59,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:59,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:59,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:59,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:59,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:59,585 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 295 [2024-11-09 06:55:59,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 273 transitions, 635 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:59,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:59,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 295 [2024-11-09 06:55:59,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:06,828 INFO L124 PetriNetUnfolderBase]: 16115/65598 cut-off events. [2024-11-09 06:56:06,828 INFO L125 PetriNetUnfolderBase]: For 3998/5356 co-relation queries the response was YES. [2024-11-09 06:56:07,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94577 conditions, 65598 events. 16115/65598 cut-off events. For 3998/5356 co-relation queries the response was YES. Maximal size of possible extension queue 1316. Compared 935316 event pairs, 9055 based on Foata normal form. 1/59281 useless extension candidates. Maximal degree in co-relation 41123. Up to 19175 conditions per place. [2024-11-09 06:56:07,209 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 33 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2024-11-09 06:56:07,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 278 transitions, 715 flow [2024-11-09 06:56:07,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 759 transitions. [2024-11-09 06:56:07,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8576271186440678 [2024-11-09 06:56:07,211 INFO L175 Difference]: Start difference. First operand has 271 places, 273 transitions, 635 flow. Second operand 3 states and 759 transitions. [2024-11-09 06:56:07,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 278 transitions, 715 flow [2024-11-09 06:56:07,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 278 transitions, 695 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:56:07,235 INFO L231 Difference]: Finished difference. Result has 272 places, 274 transitions, 627 flow [2024-11-09 06:56:07,236 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=627, PETRI_PLACES=272, PETRI_TRANSITIONS=274} [2024-11-09 06:56:07,236 INFO L277 CegarLoopForPetriNet]: 276 programPoint places, -4 predicate places. [2024-11-09 06:56:07,236 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 274 transitions, 627 flow [2024-11-09 06:56:07,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:07,237 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:07,237 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] [2024-11-09 06:56:07,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:56:07,237 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 06:56:07,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:07,238 INFO L85 PathProgramCache]: Analyzing trace with hash -806737296, now seen corresponding path program 1 times [2024-11-09 06:56:07,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:07,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054748917] [2024-11-09 06:56:07,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:07,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:56:07,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:07,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054748917] [2024-11-09 06:56:07,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054748917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:56:07,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285868877] [2024-11-09 06:56:07,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:07,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:56:07,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:56:07,312 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:56:07,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:56:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:07,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 06:56:07,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:56:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:56:07,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:56:07,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285868877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:56:07,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:56:07,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 06:56:07,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475816489] [2024-11-09 06:56:07,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:56:07,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:56:07,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:07,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:56:07,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:56:07,440 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 295 [2024-11-09 06:56:07,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 274 transitions, 627 flow. Second operand has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:07,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:07,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 295 [2024-11-09 06:56:07,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:56:19,603 INFO L124 PetriNetUnfolderBase]: 28232/111719 cut-off events. [2024-11-09 06:56:19,603 INFO L125 PetriNetUnfolderBase]: For 1400/1400 co-relation queries the response was YES. [2024-11-09 06:56:19,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157919 conditions, 111719 events. 28232/111719 cut-off events. For 1400/1400 co-relation queries the response was YES. Maximal size of possible extension queue 2383. Compared 1724128 event pairs, 17335 based on Foata normal form. 247/102373 useless extension candidates. Maximal degree in co-relation 157810. Up to 22843 conditions per place. [2024-11-09 06:56:20,322 INFO L140 encePairwiseOnDemand]: 292/295 looper letters, 47 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2024-11-09 06:56:20,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 293 transitions, 763 flow [2024-11-09 06:56:20,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:56:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:56:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2024-11-09 06:56:20,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8734463276836159 [2024-11-09 06:56:20,324 INFO L175 Difference]: Start difference. First operand has 272 places, 274 transitions, 627 flow. Second operand 3 states and 773 transitions. [2024-11-09 06:56:20,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 293 transitions, 763 flow [2024-11-09 06:56:20,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 293 transitions, 761 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:56:20,334 INFO L231 Difference]: Finished difference. Result has 274 places, 275 transitions, 637 flow [2024-11-09 06:56:20,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=637, PETRI_PLACES=274, PETRI_TRANSITIONS=275} [2024-11-09 06:56:20,335 INFO L277 CegarLoopForPetriNet]: 276 programPoint places, -2 predicate places. [2024-11-09 06:56:20,335 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 275 transitions, 637 flow [2024-11-09 06:56:20,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:20,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:56:20,336 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] [2024-11-09 06:56:20,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 06:56:20,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 06:56:20,540 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 06:56:20,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:56:20,540 INFO L85 PathProgramCache]: Analyzing trace with hash 237351089, now seen corresponding path program 1 times [2024-11-09 06:56:20,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:56:20,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862683620] [2024-11-09 06:56:20,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:20,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:56:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:56:20,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:56:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862683620] [2024-11-09 06:56:20,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862683620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:56:20,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344751858] [2024-11-09 06:56:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:56:20,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:56:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:56:20,806 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:56:20,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:56:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:56:20,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:56:20,912 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:56:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:56:20,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:56:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:56:20,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344751858] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:56:20,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:56:20,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 06:56:20,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807645681] [2024-11-09 06:56:20,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:56:20,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:56:20,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:56:20,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:56:20,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:56:21,050 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 295 [2024-11-09 06:56:21,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 275 transitions, 637 flow. Second operand has 10 states, 10 states have (on average 240.1) internal successors, (2401), 10 states have internal predecessors, (2401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:56:21,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:56:21,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 295 [2024-11-09 06:56:21,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand