./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-divine/condvar.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f 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/pthread-divine/condvar.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 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:26:52,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:26:52,474 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:26:52,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:26:52,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:26:52,507 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:26:52,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:26:52,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:26:52,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:26:52,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:26:52,512 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:26:52,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:26:52,513 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:26:52,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:26:52,513 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:26:52,516 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:26:52,517 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:26:52,517 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:26:52,517 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:26:52,517 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:26:52,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:26:52,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:26:52,518 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:26:52,518 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:26:52,519 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:26:52,519 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:26:52,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:26:52,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:26:52,520 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:26:52,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:26:52,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:26:52,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:26:52,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:26:52,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:26:52,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:26:52,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:26:52,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:26:52,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:26:52,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:26:52,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:26:52,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:26:52,523 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 -> 08550a9d023a2de1ac334a3445fa7327c26092d061f764efe50453540d837a7a [2024-11-10 14:26:52,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:26:52,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:26:52,810 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:26:52,811 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:26:52,811 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:26:52,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-divine/condvar.i [2024-11-10 14:26:54,213 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:26:54,447 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:26:54,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-divine/condvar.i [2024-11-10 14:26:54,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c549f98cd/ec8590d1eac64d57a239bc89b7beb6ad/FLAG498902bb8 [2024-11-10 14:26:54,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c549f98cd/ec8590d1eac64d57a239bc89b7beb6ad [2024-11-10 14:26:54,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:26:54,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:26:54,488 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:26:54,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:26:54,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:26:54,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:26:54" (1/1) ... [2024-11-10 14:26:54,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e0a6e34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:54, skipping insertion in model container [2024-11-10 14:26:54,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:26:54" (1/1) ... [2024-11-10 14:26:54,539 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:26:54,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:26:54,924 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:26:54,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:26:55,011 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:26:55,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:55 WrapperNode [2024-11-10 14:26:55,012 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:26:55,014 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:26:55,014 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:26:55,014 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:26:55,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:55" (1/1) ... [2024-11-10 14:26:55,036 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:55" (1/1) ... [2024-11-10 14:26:55,064 INFO L138 Inliner]: procedures = 168, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 178 [2024-11-10 14:26:55,064 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:26:55,065 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:26:55,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:26:55,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:26:55,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:55" (1/1) ... [2024-11-10 14:26:55,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:55" (1/1) ... [2024-11-10 14:26:55,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:55" (1/1) ... [2024-11-10 14:26:55,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:55" (1/1) ... [2024-11-10 14:26:55,095 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:55" (1/1) ... [2024-11-10 14:26:55,100 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:55" (1/1) ... [2024-11-10 14:26:55,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:55" (1/1) ... [2024-11-10 14:26:55,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:55" (1/1) ... [2024-11-10 14:26:55,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:26:55,115 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:26:55,115 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:26:55,115 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:26:55,116 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:55" (1/1) ... [2024-11-10 14:26:55,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:26:55,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:26:55,149 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-10 14:26:55,151 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-10 14:26:55,194 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:26:55,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:26:55,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:26:55,195 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-10 14:26:55,195 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-10 14:26:55,195 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:26:55,195 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:26:55,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:26:55,196 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:26:55,354 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:26:55,355 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:26:55,552 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:26:55,553 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:26:55,591 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:26:55,591 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:26:55,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:26:55 BoogieIcfgContainer [2024-11-10 14:26:55,592 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:26:55,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:26:55,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:26:55,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:26:55,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:26:54" (1/3) ... [2024-11-10 14:26:55,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb90fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:26:55, skipping insertion in model container [2024-11-10 14:26:55,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:26:55" (2/3) ... [2024-11-10 14:26:55,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fb90fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:26:55, skipping insertion in model container [2024-11-10 14:26:55,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:26:55" (3/3) ... [2024-11-10 14:26:55,606 INFO L112 eAbstractionObserver]: Analyzing ICFG condvar.i [2024-11-10 14:26:55,621 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:26:55,621 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 14:26:55,621 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:26:55,693 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:26:55,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 188 transitions, 383 flow [2024-11-10 14:26:55,816 INFO L124 PetriNetUnfolderBase]: 6/187 cut-off events. [2024-11-10 14:26:55,818 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:26:55,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 187 events. 6/187 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 128 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2024-11-10 14:26:55,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 188 transitions, 383 flow [2024-11-10 14:26:55,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 183 transitions, 369 flow [2024-11-10 14:26:55,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:26:55,846 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;@392478d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:26:55,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 14:26:55,889 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:26:55,890 INFO L124 PetriNetUnfolderBase]: 2/151 cut-off events. [2024-11-10 14:26:55,890 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:26:55,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:26:55,891 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:26:55,892 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 14:26:55,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:26:55,897 INFO L85 PathProgramCache]: Analyzing trace with hash -162780948, now seen corresponding path program 1 times [2024-11-10 14:26:55,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:26:55,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938174732] [2024-11-10 14:26:55,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:26:55,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:26:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:26:56,342 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-10 14:26:56,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:26:56,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938174732] [2024-11-10 14:26:56,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938174732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:26:56,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:26:56,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:26:56,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624709570] [2024-11-10 14:26:56,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:26:56,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:26:56,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:26:56,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:26:56,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:26:56,401 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 188 [2024-11-10 14:26:56,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 183 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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-10 14:26:56,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:26:56,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 188 [2024-11-10 14:26:56,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:26:56,501 INFO L124 PetriNetUnfolderBase]: 9/221 cut-off events. [2024-11-10 14:26:56,502 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:26:56,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 221 events. 9/221 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 301 event pairs, 1 based on Foata normal form. 12/215 useless extension candidates. Maximal degree in co-relation 111. Up to 15 conditions per place. [2024-11-10 14:26:56,508 INFO L140 encePairwiseOnDemand]: 180/188 looper letters, 12 selfloop transitions, 3 changer transitions 0/184 dead transitions. [2024-11-10 14:26:56,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 184 transitions, 401 flow [2024-11-10 14:26:56,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:26:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:26:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 546 transitions. [2024-11-10 14:26:56,525 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9680851063829787 [2024-11-10 14:26:56,529 INFO L175 Difference]: Start difference. First operand has 181 places, 183 transitions, 369 flow. Second operand 3 states and 546 transitions. [2024-11-10 14:26:56,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 184 transitions, 401 flow [2024-11-10 14:26:56,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 184 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:26:56,539 INFO L231 Difference]: Finished difference. Result has 183 places, 181 transitions, 384 flow [2024-11-10 14:26:56,541 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=183, PETRI_TRANSITIONS=181} [2024-11-10 14:26:56,547 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 2 predicate places. [2024-11-10 14:26:56,547 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 181 transitions, 384 flow [2024-11-10 14:26:56,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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-10 14:26:56,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:26:56,548 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:26:56,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:26:56,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 14:26:56,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:26:56,551 INFO L85 PathProgramCache]: Analyzing trace with hash -388779289, now seen corresponding path program 1 times [2024-11-10 14:26:56,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:26:56,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317361978] [2024-11-10 14:26:56,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:26:56,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:26:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:26:56,760 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-10 14:26:56,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:26:56,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317361978] [2024-11-10 14:26:56,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317361978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:26:56,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:26:56,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:26:56,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25175652] [2024-11-10 14:26:56,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:26:56,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:26:56,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:26:56,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:26:56,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:26:56,778 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 188 [2024-11-10 14:26:56,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 181 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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-10 14:26:56,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:26:56,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 188 [2024-11-10 14:26:56,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:26:56,844 INFO L124 PetriNetUnfolderBase]: 15/288 cut-off events. [2024-11-10 14:26:56,844 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-10 14:26:56,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 288 events. 15/288 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 647 event pairs, 3 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 211. Up to 23 conditions per place. [2024-11-10 14:26:56,847 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 9 selfloop transitions, 3 changer transitions 0/184 dead transitions. [2024-11-10 14:26:56,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 184 transitions, 414 flow [2024-11-10 14:26:56,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:26:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:26:56,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 535 transitions. [2024-11-10 14:26:56,852 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9485815602836879 [2024-11-10 14:26:56,853 INFO L175 Difference]: Start difference. First operand has 183 places, 181 transitions, 384 flow. Second operand 3 states and 535 transitions. [2024-11-10 14:26:56,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 184 transitions, 414 flow [2024-11-10 14:26:56,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 184 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:26:56,858 INFO L231 Difference]: Finished difference. Result has 185 places, 183 transitions, 400 flow [2024-11-10 14:26:56,859 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=185, PETRI_TRANSITIONS=183} [2024-11-10 14:26:56,859 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 4 predicate places. [2024-11-10 14:26:56,859 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 183 transitions, 400 flow [2024-11-10 14:26:56,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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-10 14:26:56,860 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:26:56,860 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:26:56,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:26:56,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 14:26:56,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:26:56,863 INFO L85 PathProgramCache]: Analyzing trace with hash 40265601, now seen corresponding path program 1 times [2024-11-10 14:26:56,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:26:56,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105790455] [2024-11-10 14:26:56,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:26:56,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:26:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:26:56,970 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-10 14:26:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:26:56,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105790455] [2024-11-10 14:26:56,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105790455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:26:56,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:26:56,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:26:56,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621923808] [2024-11-10 14:26:56,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:26:56,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:26:56,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:26:56,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:26:56,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:26:56,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 188 [2024-11-10 14:26:56,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 183 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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-10 14:26:56,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:26:56,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 188 [2024-11-10 14:26:56,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:26:57,083 INFO L124 PetriNetUnfolderBase]: 41/446 cut-off events. [2024-11-10 14:26:57,083 INFO L125 PetriNetUnfolderBase]: For 28/31 co-relation queries the response was YES. [2024-11-10 14:26:57,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 446 events. 41/446 cut-off events. For 28/31 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1857 event pairs, 8 based on Foata normal form. 0/400 useless extension candidates. Maximal degree in co-relation 454. Up to 44 conditions per place. [2024-11-10 14:26:57,087 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 14 selfloop transitions, 5 changer transitions 0/190 dead transitions. [2024-11-10 14:26:57,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 190 transitions, 456 flow [2024-11-10 14:26:57,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:26:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:26:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2024-11-10 14:26:57,091 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9432624113475178 [2024-11-10 14:26:57,091 INFO L175 Difference]: Start difference. First operand has 185 places, 183 transitions, 400 flow. Second operand 3 states and 532 transitions. [2024-11-10 14:26:57,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 190 transitions, 456 flow [2024-11-10 14:26:57,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 190 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:26:57,097 INFO L231 Difference]: Finished difference. Result has 187 places, 186 transitions, 430 flow [2024-11-10 14:26:57,099 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=430, PETRI_PLACES=187, PETRI_TRANSITIONS=186} [2024-11-10 14:26:57,100 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 6 predicate places. [2024-11-10 14:26:57,100 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 186 transitions, 430 flow [2024-11-10 14:26:57,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 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-10 14:26:57,100 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:26:57,101 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:26:57,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:26:57,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 14:26:57,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:26:57,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1353483513, now seen corresponding path program 1 times [2024-11-10 14:26:57,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:26:57,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355373153] [2024-11-10 14:26:57,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:26:57,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:26:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:26:57,235 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-10 14:26:57,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:26:57,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355373153] [2024-11-10 14:26:57,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355373153] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:26:57,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:26:57,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:26:57,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047379857] [2024-11-10 14:26:57,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:26:57,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:26:57,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:26:57,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:26:57,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:26:57,255 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 188 [2024-11-10 14:26:57,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 186 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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-10 14:26:57,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:26:57,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 188 [2024-11-10 14:26:57,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:26:57,366 INFO L124 PetriNetUnfolderBase]: 59/520 cut-off events. [2024-11-10 14:26:57,366 INFO L125 PetriNetUnfolderBase]: For 41/45 co-relation queries the response was YES. [2024-11-10 14:26:57,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 520 events. 59/520 cut-off events. For 41/45 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2453 event pairs, 9 based on Foata normal form. 5/476 useless extension candidates. Maximal degree in co-relation 627. Up to 78 conditions per place. [2024-11-10 14:26:57,371 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 13 selfloop transitions, 2 changer transitions 0/191 dead transitions. [2024-11-10 14:26:57,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 191 transitions, 470 flow [2024-11-10 14:26:57,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:26:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:26:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 532 transitions. [2024-11-10 14:26:57,374 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9432624113475178 [2024-11-10 14:26:57,374 INFO L175 Difference]: Start difference. First operand has 187 places, 186 transitions, 430 flow. Second operand 3 states and 532 transitions. [2024-11-10 14:26:57,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 191 transitions, 470 flow [2024-11-10 14:26:57,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 191 transitions, 460 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:26:57,380 INFO L231 Difference]: Finished difference. Result has 188 places, 187 transitions, 432 flow [2024-11-10 14:26:57,381 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=188, PETRI_TRANSITIONS=187} [2024-11-10 14:26:57,382 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 7 predicate places. [2024-11-10 14:26:57,382 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 187 transitions, 432 flow [2024-11-10 14:26:57,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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-10 14:26:57,383 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:26:57,383 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:26:57,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:26:57,384 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 14:26:57,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:26:57,385 INFO L85 PathProgramCache]: Analyzing trace with hash -25652894, now seen corresponding path program 1 times [2024-11-10 14:26:57,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:26:57,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773727259] [2024-11-10 14:26:57,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:26:57,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:26:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:26:57,532 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-10 14:26:57,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:26:57,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773727259] [2024-11-10 14:26:57,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773727259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:26:57,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:26:57,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:26:57,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971738158] [2024-11-10 14:26:57,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:26:57,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:26:57,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:26:57,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:26:57,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:26:57,541 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 188 [2024-11-10 14:26:57,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 187 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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-10 14:26:57,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:26:57,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 188 [2024-11-10 14:26:57,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:26:57,577 INFO L124 PetriNetUnfolderBase]: 8/233 cut-off events. [2024-11-10 14:26:57,577 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:26:57,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 233 events. 8/233 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 307 event pairs, 0 based on Foata normal form. 1/221 useless extension candidates. Maximal degree in co-relation 187. Up to 14 conditions per place. [2024-11-10 14:26:57,579 INFO L140 encePairwiseOnDemand]: 185/188 looper letters, 9 selfloop transitions, 2 changer transitions 0/184 dead transitions. [2024-11-10 14:26:57,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 184 transitions, 432 flow [2024-11-10 14:26:57,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:26:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:26:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2024-11-10 14:26:57,581 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9521276595744681 [2024-11-10 14:26:57,581 INFO L175 Difference]: Start difference. First operand has 188 places, 187 transitions, 432 flow. Second operand 3 states and 537 transitions. [2024-11-10 14:26:57,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 184 transitions, 432 flow [2024-11-10 14:26:57,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 184 transitions, 422 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-11-10 14:26:57,585 INFO L231 Difference]: Finished difference. Result has 186 places, 181 transitions, 402 flow [2024-11-10 14:26:57,585 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=186, PETRI_TRANSITIONS=181} [2024-11-10 14:26:57,586 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 5 predicate places. [2024-11-10 14:26:57,586 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 181 transitions, 402 flow [2024-11-10 14:26:57,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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-10 14:26:57,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:26:57,587 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:26:57,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:26:57,588 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 14:26:57,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:26:57,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1348240906, now seen corresponding path program 1 times [2024-11-10 14:26:57,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:26:57,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217850622] [2024-11-10 14:26:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:26:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:26:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:26:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:26:57,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:26:57,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217850622] [2024-11-10 14:26:57,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217850622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:26:57,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359039885] [2024-11-10 14:26:57,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:26:57,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:26:57,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:26:57,728 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-10 14:26:57,729 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-10 14:26:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:26:57,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:26:57,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:26:57,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:26:57,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:26:57,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359039885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:26:57,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:26:57,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-10 14:26:57,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589009553] [2024-11-10 14:26:57,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:26:57,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:26:57,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:26:57,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:26:57,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:26:57,927 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 188 [2024-11-10 14:26:57,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 181 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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-10 14:26:57,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:26:57,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 188 [2024-11-10 14:26:57,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:26:57,975 INFO L124 PetriNetUnfolderBase]: 50/339 cut-off events. [2024-11-10 14:26:57,975 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-10 14:26:57,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 339 events. 50/339 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 917 event pairs, 15 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 359. Up to 70 conditions per place. [2024-11-10 14:26:57,977 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 14 selfloop transitions, 5 changer transitions 3/189 dead transitions. [2024-11-10 14:26:57,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 189 transitions, 466 flow [2024-11-10 14:26:57,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:26:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:26:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2024-11-10 14:26:57,978 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9397163120567376 [2024-11-10 14:26:57,978 INFO L175 Difference]: Start difference. First operand has 186 places, 181 transitions, 402 flow. Second operand 3 states and 530 transitions. [2024-11-10 14:26:57,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 189 transitions, 466 flow [2024-11-10 14:26:57,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 189 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:26:57,984 INFO L231 Difference]: Finished difference. Result has 188 places, 183 transitions, 434 flow [2024-11-10 14:26:57,984 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=434, PETRI_PLACES=188, PETRI_TRANSITIONS=183} [2024-11-10 14:26:57,986 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 7 predicate places. [2024-11-10 14:26:57,986 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 183 transitions, 434 flow [2024-11-10 14:26:57,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 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-10 14:26:57,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:26:57,987 INFO L204 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:26:58,005 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-10 14:26:58,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 14:26:58,189 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 14:26:58,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:26:58,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1066516777, now seen corresponding path program 1 times [2024-11-10 14:26:58,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:26:58,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485792074] [2024-11-10 14:26:58,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:26:58,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:26:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:26:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:26:58,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:26:58,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485792074] [2024-11-10 14:26:58,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485792074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:26:58,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407900375] [2024-11-10 14:26:58,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:26:58,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:26:58,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:26:58,337 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-10 14:26:58,338 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-10 14:26:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:26:58,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:26:58,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:26:58,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:26:58,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:26:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:26:58,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407900375] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:26:58,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:26:58,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 14:26:58,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752201347] [2024-11-10 14:26:58,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:26:58,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 14:26:58,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:26:58,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 14:26:58,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 14:26:58,674 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 188 [2024-11-10 14:26:58,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 183 transitions, 434 flow. Second operand has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 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-10 14:26:58,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:26:58,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 188 [2024-11-10 14:26:58,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:26:58,825 INFO L124 PetriNetUnfolderBase]: 61/437 cut-off events. [2024-11-10 14:26:58,825 INFO L125 PetriNetUnfolderBase]: For 61/64 co-relation queries the response was YES. [2024-11-10 14:26:58,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 437 events. 61/437 cut-off events. For 61/64 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1239 event pairs, 12 based on Foata normal form. 8/433 useless extension candidates. Maximal degree in co-relation 568. Up to 47 conditions per place. [2024-11-10 14:26:58,827 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 34 selfloop transitions, 9 changer transitions 0/212 dead transitions. [2024-11-10 14:26:58,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 212 transitions, 580 flow [2024-11-10 14:26:58,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 14:26:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 14:26:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1566 transitions. [2024-11-10 14:26:58,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.925531914893617 [2024-11-10 14:26:58,831 INFO L175 Difference]: Start difference. First operand has 188 places, 183 transitions, 434 flow. Second operand 9 states and 1566 transitions. [2024-11-10 14:26:58,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 212 transitions, 580 flow [2024-11-10 14:26:58,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 212 transitions, 570 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:26:58,835 INFO L231 Difference]: Finished difference. Result has 197 places, 189 transitions, 474 flow [2024-11-10 14:26:58,835 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=474, PETRI_PLACES=197, PETRI_TRANSITIONS=189} [2024-11-10 14:26:58,837 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 16 predicate places. [2024-11-10 14:26:58,837 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 189 transitions, 474 flow [2024-11-10 14:26:58,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 171.0) internal successors, (1710), 10 states have internal predecessors, (1710), 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-10 14:26:58,839 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:26:58,839 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:26:58,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 14:26:59,039 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,SelfDestructingSolverStorable6 [2024-11-10 14:26:59,040 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 14:26:59,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:26:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash 2051961247, now seen corresponding path program 2 times [2024-11-10 14:26:59,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:26:59,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876589887] [2024-11-10 14:26:59,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:26:59,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:26:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:26:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:26:59,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:26:59,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876589887] [2024-11-10 14:26:59,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876589887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:26:59,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682908921] [2024-11-10 14:26:59,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:26:59,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:26:59,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:26:59,253 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-10 14:26:59,255 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-10 14:26:59,417 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:26:59,418 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:26:59,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 14:26:59,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:26:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:26:59,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:26:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:26:59,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682908921] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:26:59,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:26:59,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2024-11-10 14:26:59,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746865763] [2024-11-10 14:26:59,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:26:59,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 14:26:59,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:26:59,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 14:26:59,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-10 14:26:59,686 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 188 [2024-11-10 14:26:59,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 189 transitions, 474 flow. Second operand has 18 states, 18 states have (on average 171.05555555555554) internal successors, (3079), 18 states have internal predecessors, (3079), 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-10 14:26:59,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:26:59,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 188 [2024-11-10 14:26:59,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:00,002 INFO L124 PetriNetUnfolderBase]: 109/629 cut-off events. [2024-11-10 14:27:00,003 INFO L125 PetriNetUnfolderBase]: For 276/279 co-relation queries the response was YES. [2024-11-10 14:27:00,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 629 events. 109/629 cut-off events. For 276/279 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1971 event pairs, 12 based on Foata normal form. 16/633 useless extension candidates. Maximal degree in co-relation 1078. Up to 47 conditions per place. [2024-11-10 14:27:00,007 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 74 selfloop transitions, 21 changer transitions 0/264 dead transitions. [2024-11-10 14:27:00,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 264 transitions, 874 flow [2024-11-10 14:27:00,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 14:27:00,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-10 14:27:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3648 transitions. [2024-11-10 14:27:00,015 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9240121580547113 [2024-11-10 14:27:00,015 INFO L175 Difference]: Start difference. First operand has 197 places, 189 transitions, 474 flow. Second operand 21 states and 3648 transitions. [2024-11-10 14:27:00,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 264 transitions, 874 flow [2024-11-10 14:27:00,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 264 transitions, 860 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-10 14:27:00,021 INFO L231 Difference]: Finished difference. Result has 221 places, 202 transitions, 598 flow [2024-11-10 14:27:00,022 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=598, PETRI_PLACES=221, PETRI_TRANSITIONS=202} [2024-11-10 14:27:00,022 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 40 predicate places. [2024-11-10 14:27:00,023 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 202 transitions, 598 flow [2024-11-10 14:27:00,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 171.05555555555554) internal successors, (3079), 18 states have internal predecessors, (3079), 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-10 14:27:00,025 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:00,025 INFO L204 CegarLoopForPetriNet]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:27:00,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 14:27:00,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:27:00,226 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 14:27:00,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:00,227 INFO L85 PathProgramCache]: Analyzing trace with hash 281527519, now seen corresponding path program 3 times [2024-11-10 14:27:00,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:00,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54771418] [2024-11-10 14:27:00,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:00,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:00,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:00,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54771418] [2024-11-10 14:27:00,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54771418] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:27:00,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194755711] [2024-11-10 14:27:00,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 14:27:00,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:27:00,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:27:00,677 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:27:00,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 14:27:00,947 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-10 14:27:00,948 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:27:00,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 14:27:00,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:27:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:01,082 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:27:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:01,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194755711] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:27:01,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:27:01,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2024-11-10 14:27:01,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153796772] [2024-11-10 14:27:01,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:27:01,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-10 14:27:01,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:01,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-10 14:27:01,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2024-11-10 14:27:01,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 188 [2024-11-10 14:27:01,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 202 transitions, 598 flow. Second operand has 34 states, 34 states have (on average 171.02941176470588) internal successors, (5815), 34 states have internal predecessors, (5815), 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-10 14:27:01,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:01,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 188 [2024-11-10 14:27:01,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:02,456 INFO L124 PetriNetUnfolderBase]: 264/1072 cut-off events. [2024-11-10 14:27:02,456 INFO L125 PetriNetUnfolderBase]: For 1745/1748 co-relation queries the response was YES. [2024-11-10 14:27:02,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2531 conditions, 1072 events. 264/1072 cut-off events. For 1745/1748 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3519 event pairs, 9 based on Foata normal form. 32/1091 useless extension candidates. Maximal degree in co-relation 2376. Up to 127 conditions per place. [2024-11-10 14:27:02,464 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 154 selfloop transitions, 45 changer transitions 0/368 dead transitions. [2024-11-10 14:27:02,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 368 transitions, 1542 flow [2024-11-10 14:27:02,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-10 14:27:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-11-10 14:27:02,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 7812 transitions. [2024-11-10 14:27:02,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9234042553191489 [2024-11-10 14:27:02,481 INFO L175 Difference]: Start difference. First operand has 221 places, 202 transitions, 598 flow. Second operand 45 states and 7812 transitions. [2024-11-10 14:27:02,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 368 transitions, 1542 flow [2024-11-10 14:27:02,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 368 transitions, 1502 flow, removed 14 selfloop flow, removed 6 redundant places. [2024-11-10 14:27:02,491 INFO L231 Difference]: Finished difference. Result has 268 places, 227 transitions, 876 flow [2024-11-10 14:27:02,492 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=876, PETRI_PLACES=268, PETRI_TRANSITIONS=227} [2024-11-10 14:27:02,493 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 87 predicate places. [2024-11-10 14:27:02,493 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 227 transitions, 876 flow [2024-11-10 14:27:02,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 171.02941176470588) internal successors, (5815), 34 states have internal predecessors, (5815), 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-10 14:27:02,495 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:02,496 INFO L204 CegarLoopForPetriNet]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:27:02,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 14:27:02,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:27:02,700 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 14:27:02,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash -468389281, now seen corresponding path program 4 times [2024-11-10 14:27:02,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:02,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706579004] [2024-11-10 14:27:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:02,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:03,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:03,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706579004] [2024-11-10 14:27:03,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706579004] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:27:03,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358062135] [2024-11-10 14:27:03,659 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 14:27:03,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:27:03,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:27:03,661 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:27:03,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 14:27:03,838 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 14:27:03,838 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:27:03,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 14:27:03,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:27:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:04,054 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:27:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 0 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:05,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358062135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:27:05,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:27:05,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2024-11-10 14:27:05,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293663996] [2024-11-10 14:27:05,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:27:05,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-10 14:27:05,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:05,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-10 14:27:05,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2024-11-10 14:27:05,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 188 [2024-11-10 14:27:05,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 227 transitions, 876 flow. Second operand has 66 states, 66 states have (on average 171.0151515151515) internal successors, (11287), 66 states have internal predecessors, (11287), 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-10 14:27:05,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:05,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 188 [2024-11-10 14:27:05,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:07,947 INFO L124 PetriNetUnfolderBase]: 397/1781 cut-off events. [2024-11-10 14:27:07,947 INFO L125 PetriNetUnfolderBase]: For 11194/11197 co-relation queries the response was YES. [2024-11-10 14:27:07,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5062 conditions, 1781 events. 397/1781 cut-off events. For 11194/11197 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 6416 event pairs, 12 based on Foata normal form. 64/1833 useless extension candidates. Maximal degree in co-relation 4898. Up to 232 conditions per place. [2024-11-10 14:27:07,959 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 314 selfloop transitions, 93 changer transitions 0/576 dead transitions. [2024-11-10 14:27:07,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 576 transitions, 3024 flow [2024-11-10 14:27:07,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2024-11-10 14:27:07,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2024-11-10 14:27:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 16140 transitions. [2024-11-10 14:27:07,976 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9231297185998627 [2024-11-10 14:27:07,976 INFO L175 Difference]: Start difference. First operand has 268 places, 227 transitions, 876 flow. Second operand 93 states and 16140 transitions. [2024-11-10 14:27:07,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 576 transitions, 3024 flow [2024-11-10 14:27:07,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 576 transitions, 2936 flow, removed 26 selfloop flow, removed 18 redundant places. [2024-11-10 14:27:07,994 INFO L231 Difference]: Finished difference. Result has 359 places, 276 transitions, 1510 flow [2024-11-10 14:27:07,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=820, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=93, PETRI_FLOW=1510, PETRI_PLACES=359, PETRI_TRANSITIONS=276} [2024-11-10 14:27:07,995 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 178 predicate places. [2024-11-10 14:27:07,995 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 276 transitions, 1510 flow [2024-11-10 14:27:08,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 171.0151515151515) internal successors, (11287), 66 states have internal predecessors, (11287), 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-10 14:27:08,000 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:08,001 INFO L204 CegarLoopForPetriNet]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:27:08,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 14:27:08,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 14:27:08,206 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 14:27:08,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:08,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1938464991, now seen corresponding path program 5 times [2024-11-10 14:27:08,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:08,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611286993] [2024-11-10 14:27:08,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:08,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:10,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4247 backedges. 0 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:10,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:10,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611286993] [2024-11-10 14:27:10,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611286993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:27:10,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145877908] [2024-11-10 14:27:10,985 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 14:27:10,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:27:10,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:27:10,987 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:27:10,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 14:27:11,228 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2024-11-10 14:27:11,228 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:27:11,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 749 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-10 14:27:11,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:27:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4247 backedges. 0 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:11,637 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:27:13,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4247 backedges. 0 proven. 4247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:13,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145877908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:27:13,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:27:13,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 89 [2024-11-10 14:27:13,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549165505] [2024-11-10 14:27:13,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:27:13,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2024-11-10 14:27:13,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:13,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2024-11-10 14:27:13,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2024-11-10 14:27:13,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 188 [2024-11-10 14:27:13,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 276 transitions, 1510 flow. Second operand has 89 states, 89 states have (on average 171.03370786516854) internal successors, (15222), 89 states have internal predecessors, (15222), 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-10 14:27:13,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:13,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 188 [2024-11-10 14:27:13,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:18,001 INFO L124 PetriNetUnfolderBase]: 712/2528 cut-off events. [2024-11-10 14:27:18,002 INFO L125 PetriNetUnfolderBase]: For 32253/32256 co-relation queries the response was YES. [2024-11-10 14:27:18,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7893 conditions, 2528 events. 712/2528 cut-off events. For 32253/32256 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 8774 event pairs, 9 based on Foata normal form. 48/2563 useless extension candidates. Maximal degree in co-relation 7712. Up to 351 conditions per place. [2024-11-10 14:27:18,024 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 434 selfloop transitions, 129 changer transitions 0/732 dead transitions. [2024-11-10 14:27:18,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 732 transitions, 4378 flow [2024-11-10 14:27:18,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-11-10 14:27:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2024-11-10 14:27:18,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 22376 transitions. [2024-11-10 14:27:18,058 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9226455550057727 [2024-11-10 14:27:18,058 INFO L175 Difference]: Start difference. First operand has 359 places, 276 transitions, 1510 flow. Second operand 129 states and 22376 transitions. [2024-11-10 14:27:18,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 732 transitions, 4378 flow [2024-11-10 14:27:18,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 732 transitions, 4234 flow, removed 30 selfloop flow, removed 42 redundant places. [2024-11-10 14:27:18,101 INFO L231 Difference]: Finished difference. Result has 458 places, 313 transitions, 2108 flow [2024-11-10 14:27:18,102 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=1390, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=129, PETRI_FLOW=2108, PETRI_PLACES=458, PETRI_TRANSITIONS=313} [2024-11-10 14:27:18,103 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 277 predicate places. [2024-11-10 14:27:18,103 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 313 transitions, 2108 flow [2024-11-10 14:27:18,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 171.03370786516854) internal successors, (15222), 89 states have internal predecessors, (15222), 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-10 14:27:18,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:18,109 INFO L204 CegarLoopForPetriNet]: trace histogram [44, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 14:27:18,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 14:27:18,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:27:18,313 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-11-10 14:27:18,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:18,314 INFO L85 PathProgramCache]: Analyzing trace with hash 516756767, now seen corresponding path program 6 times [2024-11-10 14:27:18,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:18,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937289649] [2024-11-10 14:27:18,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:18,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:27:18,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:27:18,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:27:18,581 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:27:18,582 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:27:18,583 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 7 remaining) [2024-11-10 14:27:18,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-10 14:27:18,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-10 14:27:18,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 14:27:18,585 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-10 14:27:18,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-10 14:27:18,586 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-11-10 14:27:18,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:27:18,586 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2024-11-10 14:27:18,777 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:27:18,778 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:27:18,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:27:18 BasicIcfg [2024-11-10 14:27:18,783 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:27:18,784 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:27:18,784 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:27:18,784 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:27:18,785 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:26:55" (3/4) ... [2024-11-10 14:27:18,785 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 14:27:18,919 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:27:18,919 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:27:18,919 INFO L158 Benchmark]: Toolchain (without parser) took 24434.16ms. Allocated memory was 184.5MB in the beginning and 570.4MB in the end (delta: 385.9MB). Free memory was 152.0MB in the beginning and 189.7MB in the end (delta: -37.7MB). Peak memory consumption was 348.4MB. Max. memory is 16.1GB. [2024-11-10 14:27:18,920 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:27:18,920 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.91ms. Allocated memory is still 184.5MB. Free memory was 152.0MB in the beginning and 129.1MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 14:27:18,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.07ms. Allocated memory is still 184.5MB. Free memory was 129.1MB in the beginning and 126.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:27:18,920 INFO L158 Benchmark]: Boogie Preprocessor took 44.47ms. Allocated memory is still 184.5MB. Free memory was 126.0MB in the beginning and 124.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:27:18,920 INFO L158 Benchmark]: IcfgBuilder took 477.09ms. Allocated memory is still 184.5MB. Free memory was 124.9MB in the beginning and 138.2MB in the end (delta: -13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 14:27:18,921 INFO L158 Benchmark]: TraceAbstraction took 23184.29ms. Allocated memory was 184.5MB in the beginning and 570.4MB in the end (delta: 385.9MB). Free memory was 137.1MB in the beginning and 241.1MB in the end (delta: -104.0MB). Peak memory consumption was 284.0MB. Max. memory is 16.1GB. [2024-11-10 14:27:18,921 INFO L158 Benchmark]: Witness Printer took 135.21ms. Allocated memory is still 570.4MB. Free memory was 241.1MB in the beginning and 189.7MB in the end (delta: 51.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-11-10 14:27:18,926 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 119.5MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.91ms. Allocated memory is still 184.5MB. Free memory was 152.0MB in the beginning and 129.1MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.07ms. Allocated memory is still 184.5MB. Free memory was 129.1MB in the beginning and 126.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.47ms. Allocated memory is still 184.5MB. Free memory was 126.0MB in the beginning and 124.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 477.09ms. Allocated memory is still 184.5MB. Free memory was 124.9MB in the beginning and 138.2MB in the end (delta: -13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 23184.29ms. Allocated memory was 184.5MB in the beginning and 570.4MB in the end (delta: 385.9MB). Free memory was 137.1MB in the beginning and 241.1MB in the end (delta: -104.0MB). Peak memory consumption was 284.0MB. Max. memory is 16.1GB. * Witness Printer took 135.21ms. Allocated memory is still 570.4MB. Free memory was 241.1MB in the beginning and 189.7MB in the end (delta: 51.4MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 704]: Data race detected Data race detected The following path leads to a data race: [L697] 0 pthread_mutex_t lock; VAL [lock={3:0}] [L698] 0 pthread_cond_t cond; VAL [lock={3:0}] [L699] 0 int x; VAL [lock={3:0}, x=0] [L700] 0 _Bool x_set = 0; VAL [lock={3:0}, x=0, x_set=0] [L711] 0 pthread_t t; VAL [lock={3:0}, x=0, x_set=0] [L712] FCALL, FORK 0 pthread_create( &t, ((void *)0), thread, ((void *)0) ) VAL [lock={3:0}, t=-1, x=0, x_set=0] [L713] 0 int i = 0; VAL [i=0, lock={3:0}, t=-1, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=0, lock={3:0}, t=-1, x=0, x_set=0] [L714] 0 x = i VAL [i=0, lock={3:0}, t=-1, x=0, x_set=0] [L713] 0 i++ VAL [i=1, lock={3:0}, t=-1, x=0, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=1, lock={3:0}, t=-1, x=0, x_set=0] [L714] 0 x = i VAL [i=1, lock={3:0}, t=-1, x=1, x_set=0] [L713] 0 i++ VAL [i=2, lock={3:0}, t=-1, x=1, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=2, lock={3:0}, t=-1, x=1, x_set=0] [L714] 0 x = i VAL [i=2, lock={3:0}, t=-1, x=2, x_set=0] [L713] 0 i++ VAL [i=3, lock={3:0}, t=-1, x=2, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=3, lock={3:0}, t=-1, x=2, x_set=0] [L714] 0 x = i VAL [i=3, lock={3:0}, t=-1, x=3, x_set=0] [L713] 0 i++ VAL [i=4, lock={3:0}, t=-1, x=3, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=4, lock={3:0}, t=-1, x=3, x_set=0] [L714] 0 x = i VAL [i=4, lock={3:0}, t=-1, x=4, x_set=0] [L713] 0 i++ VAL [i=5, lock={3:0}, t=-1, x=4, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=5, lock={3:0}, t=-1, x=4, x_set=0] [L714] 0 x = i VAL [i=5, lock={3:0}, t=-1, x=5, x_set=0] [L713] 0 i++ VAL [i=6, lock={3:0}, t=-1, x=5, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=6, lock={3:0}, t=-1, x=5, x_set=0] [L714] 0 x = i VAL [i=6, lock={3:0}, t=-1, x=6, x_set=0] [L713] 0 i++ VAL [i=7, lock={3:0}, t=-1, x=6, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=7, lock={3:0}, t=-1, x=6, x_set=0] [L714] 0 x = i VAL [i=7, lock={3:0}, t=-1, x=7, x_set=0] [L713] 0 i++ VAL [i=8, lock={3:0}, t=-1, x=7, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=8, lock={3:0}, t=-1, x=7, x_set=0] [L714] 0 x = i VAL [i=8, lock={3:0}, t=-1, x=8, x_set=0] [L713] 0 i++ VAL [i=9, lock={3:0}, t=-1, x=8, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=9, lock={3:0}, t=-1, x=8, x_set=0] [L714] 0 x = i VAL [i=9, lock={3:0}, t=-1, x=9, x_set=0] [L713] 0 i++ VAL [i=10, lock={3:0}, t=-1, x=9, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=10, lock={3:0}, t=-1, x=9, x_set=0] [L714] 0 x = i VAL [i=10, lock={3:0}, t=-1, x=10, x_set=0] [L713] 0 i++ VAL [i=11, lock={3:0}, t=-1, x=10, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=11, lock={3:0}, t=-1, x=10, x_set=0] [L714] 0 x = i VAL [i=11, lock={3:0}, t=-1, x=11, x_set=0] [L713] 0 i++ VAL [i=12, lock={3:0}, t=-1, x=11, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=12, lock={3:0}, t=-1, x=11, x_set=0] [L714] 0 x = i VAL [i=12, lock={3:0}, t=-1, x=12, x_set=0] [L713] 0 i++ VAL [i=13, lock={3:0}, t=-1, x=12, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=13, lock={3:0}, t=-1, x=12, x_set=0] [L714] 0 x = i VAL [i=13, lock={3:0}, t=-1, x=13, x_set=0] [L713] 0 i++ VAL [i=14, lock={3:0}, t=-1, x=13, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=14, lock={3:0}, t=-1, x=13, x_set=0] [L714] 0 x = i VAL [i=14, lock={3:0}, t=-1, x=14, x_set=0] [L713] 0 i++ VAL [i=15, lock={3:0}, t=-1, x=14, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=15, lock={3:0}, t=-1, x=14, x_set=0] [L714] 0 x = i VAL [i=15, lock={3:0}, t=-1, x=15, x_set=0] [L713] 0 i++ VAL [i=16, lock={3:0}, t=-1, x=15, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=16, lock={3:0}, t=-1, x=15, x_set=0] [L714] 0 x = i VAL [i=16, lock={3:0}, t=-1, x=16, x_set=0] [L713] 0 i++ VAL [i=17, lock={3:0}, t=-1, x=16, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=17, lock={3:0}, t=-1, x=16, x_set=0] [L714] 0 x = i VAL [i=17, lock={3:0}, t=-1, x=17, x_set=0] [L713] 0 i++ VAL [i=18, lock={3:0}, t=-1, x=17, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=18, lock={3:0}, t=-1, x=17, x_set=0] [L714] 0 x = i VAL [i=18, lock={3:0}, t=-1, x=18, x_set=0] [L713] 0 i++ VAL [i=19, lock={3:0}, t=-1, x=18, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=19, lock={3:0}, t=-1, x=18, x_set=0] [L714] 0 x = i VAL [i=19, lock={3:0}, t=-1, x=19, x_set=0] [L713] 0 i++ VAL [i=20, lock={3:0}, t=-1, x=19, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=20, lock={3:0}, t=-1, x=19, x_set=0] [L714] 0 x = i VAL [i=20, lock={3:0}, t=-1, x=20, x_set=0] [L713] 0 i++ VAL [i=21, lock={3:0}, t=-1, x=20, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=21, lock={3:0}, t=-1, x=20, x_set=0] [L714] 0 x = i VAL [i=21, lock={3:0}, t=-1, x=21, x_set=0] [L713] 0 i++ VAL [i=22, lock={3:0}, t=-1, x=21, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=22, lock={3:0}, t=-1, x=21, x_set=0] [L714] 0 x = i VAL [i=22, lock={3:0}, t=-1, x=22, x_set=0] [L713] 0 i++ VAL [i=23, lock={3:0}, t=-1, x=22, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=23, lock={3:0}, t=-1, x=22, x_set=0] [L714] 0 x = i VAL [i=23, lock={3:0}, t=-1, x=23, x_set=0] [L713] 0 i++ VAL [i=24, lock={3:0}, t=-1, x=23, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=24, lock={3:0}, t=-1, x=23, x_set=0] [L714] 0 x = i VAL [i=24, lock={3:0}, t=-1, x=24, x_set=0] [L713] 0 i++ VAL [i=25, lock={3:0}, t=-1, x=24, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=25, lock={3:0}, t=-1, x=24, x_set=0] [L714] 0 x = i VAL [i=25, lock={3:0}, t=-1, x=25, x_set=0] [L713] 0 i++ VAL [i=26, lock={3:0}, t=-1, x=25, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=26, lock={3:0}, t=-1, x=25, x_set=0] [L714] 0 x = i VAL [i=26, lock={3:0}, t=-1, x=26, x_set=0] [L713] 0 i++ VAL [i=27, lock={3:0}, t=-1, x=26, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=27, lock={3:0}, t=-1, x=26, x_set=0] [L714] 0 x = i VAL [i=27, lock={3:0}, t=-1, x=27, x_set=0] [L713] 0 i++ VAL [i=28, lock={3:0}, t=-1, x=27, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=28, lock={3:0}, t=-1, x=27, x_set=0] [L714] 0 x = i VAL [i=28, lock={3:0}, t=-1, x=28, x_set=0] [L713] 0 i++ VAL [i=29, lock={3:0}, t=-1, x=28, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=29, lock={3:0}, t=-1, x=28, x_set=0] [L714] 0 x = i VAL [i=29, lock={3:0}, t=-1, x=29, x_set=0] [L713] 0 i++ VAL [i=30, lock={3:0}, t=-1, x=29, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=30, lock={3:0}, t=-1, x=29, x_set=0] [L714] 0 x = i VAL [i=30, lock={3:0}, t=-1, x=30, x_set=0] [L713] 0 i++ VAL [i=31, lock={3:0}, t=-1, x=30, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=31, lock={3:0}, t=-1, x=30, x_set=0] [L714] 0 x = i VAL [i=31, lock={3:0}, t=-1, x=31, x_set=0] [L713] 0 i++ VAL [i=32, lock={3:0}, t=-1, x=31, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=32, lock={3:0}, t=-1, x=31, x_set=0] [L714] 0 x = i VAL [i=32, lock={3:0}, t=-1, x=32, x_set=0] [L713] 0 i++ VAL [i=33, lock={3:0}, t=-1, x=32, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=33, lock={3:0}, t=-1, x=32, x_set=0] [L714] 0 x = i VAL [i=33, lock={3:0}, t=-1, x=33, x_set=0] [L713] 0 i++ VAL [i=34, lock={3:0}, t=-1, x=33, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=34, lock={3:0}, t=-1, x=33, x_set=0] [L714] 0 x = i VAL [i=34, lock={3:0}, t=-1, x=34, x_set=0] [L713] 0 i++ VAL [i=35, lock={3:0}, t=-1, x=34, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=35, lock={3:0}, t=-1, x=34, x_set=0] [L714] 0 x = i VAL [i=35, lock={3:0}, t=-1, x=35, x_set=0] [L713] 0 i++ VAL [i=36, lock={3:0}, t=-1, x=35, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=36, lock={3:0}, t=-1, x=35, x_set=0] [L714] 0 x = i VAL [i=36, lock={3:0}, t=-1, x=36, x_set=0] [L713] 0 i++ VAL [i=37, lock={3:0}, t=-1, x=36, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=37, lock={3:0}, t=-1, x=36, x_set=0] [L714] 0 x = i VAL [i=37, lock={3:0}, t=-1, x=37, x_set=0] [L713] 0 i++ VAL [i=38, lock={3:0}, t=-1, x=37, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=38, lock={3:0}, t=-1, x=37, x_set=0] [L714] 0 x = i VAL [i=38, lock={3:0}, t=-1, x=38, x_set=0] [L713] 0 i++ VAL [i=39, lock={3:0}, t=-1, x=38, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=39, lock={3:0}, t=-1, x=38, x_set=0] [L714] 0 x = i VAL [i=39, lock={3:0}, t=-1, x=39, x_set=0] [L713] 0 i++ VAL [i=40, lock={3:0}, t=-1, x=39, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=40, lock={3:0}, t=-1, x=39, x_set=0] [L714] 0 x = i VAL [i=40, lock={3:0}, t=-1, x=40, x_set=0] [L713] 0 i++ VAL [i=41, lock={3:0}, t=-1, x=40, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=41, lock={3:0}, t=-1, x=40, x_set=0] [L714] 0 x = i VAL [i=41, lock={3:0}, t=-1, x=41, x_set=0] [L713] 0 i++ VAL [i=42, lock={3:0}, t=-1, x=41, x_set=0] [L713] COND TRUE 0 i <= 42 VAL [i=42, lock={3:0}, t=-1, x=41, x_set=0] [L714] 0 x = i VAL [i=42, lock={3:0}, t=-1, x=42, x_set=0] [L713] 0 i++ VAL [i=43, lock={3:0}, t=-1, x=42, x_set=0] [L713] COND FALSE 0 !(i <= 42) VAL [i=43, lock={3:0}, t=-1, x=42, x_set=0] [L715] 0 x_set = 1 VAL [lock={3:0}, t=-1, x=42, x_set=1] [L704] 1 !x_set VAL [\old(arg)={0:0}, arg={0:0}, lock={3:0}, x=42, x_set=1] [L715] 0 x_set = 1 VAL [lock={3:0}, t=-1, x=42, x_set=1] [L704] 1 !x_set VAL [\old(arg)={0:0}, arg={0:0}, lock={3:0}, x=42, x_set=1] Now there is a data race on ~x_set~0 between C: x_set = 1 [715] and C: !x_set [704] - UnprovableResult [Line: 714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 206 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 22.9s, OverallIterations: 12, TraceHistogramMax: 44, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4508 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4440 mSDsluCounter, 394 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 361 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1959 IncrementalHoareTripleChecker+Invalid, 1972 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 33 mSDtfsCounter, 1959 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3004 GetRequests, 2559 SyntacticMatches, 41 SemanticMatches, 404 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13224 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2108occurred in iteration=11, InterpolantAutomatonStates: 315, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 4101 NumberOfCodeBlocks, 4101 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 4805 ConstructedInterpolants, 0 QuantifiedInterpolants, 8089 SizeOfPredicates, 114 NumberOfNonLiveVariables, 2687 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 2/16384 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 14:27:18,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE