./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.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 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:40:48,377 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:40:48,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:40:48,418 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:40:48,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:40:48,435 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:40:48,436 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:40:48,436 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:40:48,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:40:48,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:40:48,437 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:40:48,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:40:48,438 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:40:48,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:40:48,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:40:48,441 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:40:48,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:40:48,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:40:48,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:40:48,442 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:40:48,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:40:48,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:40:48,448 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:40:48,448 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:40:48,448 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:40:48,448 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:40:48,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:40:48,449 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:40:48,449 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:40:48,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:40:48,449 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:40:48,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:40:48,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:40:48,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:40:48,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:40:48,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:40:48,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:40:48,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:40:48,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:40:48,451 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:40:48,451 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:40:48,452 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 -> 051706a1eb405a384d7cf371ab2d9b9605b94715fa3ad16d6c2eb8e3fbb8fc38 [2024-11-12 12:40:48,678 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:40:48,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:40:48,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:40:48,702 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:40:48,702 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:40:48,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-12 12:40:49,963 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:40:50,201 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:40:50,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/arithmetic_prog_bad.i [2024-11-12 12:40:50,221 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190e7ca1b/26877bb4275f48e583d1c6493ab86d02/FLAGe1f42a0b5 [2024-11-12 12:40:50,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/190e7ca1b/26877bb4275f48e583d1c6493ab86d02 [2024-11-12 12:40:50,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:40:50,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:40:50,242 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:40:50,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:40:50,247 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:40:50,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:40:50" (1/1) ... [2024-11-12 12:40:50,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72f3442 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:50, skipping insertion in model container [2024-11-12 12:40:50,250 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:40:50" (1/1) ... [2024-11-12 12:40:50,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:40:50,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:40:50,696 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:40:50,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:40:50,803 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:40:50,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:50 WrapperNode [2024-11-12 12:40:50,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:40:50,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:40:50,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:40:50,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:40:50,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:50" (1/1) ... [2024-11-12 12:40:50,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:50" (1/1) ... [2024-11-12 12:40:50,875 INFO L138 Inliner]: procedures = 243, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 274 [2024-11-12 12:40:50,875 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:40:50,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:40:50,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:40:50,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:40:50,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:50" (1/1) ... [2024-11-12 12:40:50,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:50" (1/1) ... [2024-11-12 12:40:50,894 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:50" (1/1) ... [2024-11-12 12:40:50,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:50" (1/1) ... [2024-11-12 12:40:50,906 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:50" (1/1) ... [2024-11-12 12:40:50,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:50" (1/1) ... [2024-11-12 12:40:50,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:50" (1/1) ... [2024-11-12 12:40:50,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:50" (1/1) ... [2024-11-12 12:40:50,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:40:50,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:40:50,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:40:50,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:40:50,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:50" (1/1) ... [2024-11-12 12:40:50,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:40:50,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:40:50,978 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:40:50,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:40:51,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-12 12:40:51,018 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-12 12:40:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 12:40:51,019 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 12:40:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 12:40:51,019 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 12:40:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-12 12:40:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:40:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:40:51,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:40:51,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:40:51,021 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:40:51,150 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:40:51,151 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:40:51,533 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:40:51,533 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:40:51,560 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:40:51,560 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-12 12:40:51,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:51 BoogieIcfgContainer [2024-11-12 12:40:51,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:40:51,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:40:51,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:40:51,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:40:51,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:40:50" (1/3) ... [2024-11-12 12:40:51,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de75da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:40:51, skipping insertion in model container [2024-11-12 12:40:51,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:50" (2/3) ... [2024-11-12 12:40:51,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de75da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:40:51, skipping insertion in model container [2024-11-12 12:40:51,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:51" (3/3) ... [2024-11-12 12:40:51,568 INFO L112 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_bad.i [2024-11-12 12:40:51,586 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:40:51,587 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-11-12 12:40:51,587 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:40:51,658 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 12:40:51,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 375 places, 379 transitions, 772 flow [2024-11-12 12:40:51,833 INFO L124 PetriNetUnfolderBase]: 11/377 cut-off events. [2024-11-12 12:40:51,834 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 12:40:51,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 377 events. 11/377 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 284 event pairs, 0 based on Foata normal form. 0/351 useless extension candidates. Maximal degree in co-relation 296. Up to 3 conditions per place. [2024-11-12 12:40:51,860 INFO L82 GeneralOperation]: Start removeDead. Operand has 375 places, 379 transitions, 772 flow [2024-11-12 12:40:51,871 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 362 places, 363 transitions, 738 flow [2024-11-12 12:40:51,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:40:51,896 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;@4a3581fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:40:51,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2024-11-12 12:40:51,935 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:40:51,935 INFO L124 PetriNetUnfolderBase]: 0/241 cut-off events. [2024-11-12 12:40:51,935 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:40:51,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:51,936 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:51,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-12 12:40:51,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:51,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1274538100, now seen corresponding path program 1 times [2024-11-12 12:40:51,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:51,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289241833] [2024-11-12 12:40:51,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:51,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:52,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:52,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289241833] [2024-11-12 12:40:52,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289241833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:52,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:52,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:52,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663221373] [2024-11-12 12:40:52,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:52,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:52,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:52,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:52,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:52,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 379 [2024-11-12 12:40:52,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 363 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:52,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:52,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 379 [2024-11-12 12:40:52,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:52,656 INFO L124 PetriNetUnfolderBase]: 89/653 cut-off events. [2024-11-12 12:40:52,656 INFO L125 PetriNetUnfolderBase]: For 62/68 co-relation queries the response was YES. [2024-11-12 12:40:52,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 653 events. 89/653 cut-off events. For 62/68 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2056 event pairs, 53 based on Foata normal form. 23/615 useless extension candidates. Maximal degree in co-relation 517. Up to 163 conditions per place. [2024-11-12 12:40:52,665 INFO L140 encePairwiseOnDemand]: 372/379 looper letters, 21 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-12 12:40:52,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 358 transitions, 774 flow [2024-11-12 12:40:52,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1069 transitions. [2024-11-12 12:40:52,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.940193491644679 [2024-11-12 12:40:52,684 INFO L175 Difference]: Start difference. First operand has 362 places, 363 transitions, 738 flow. Second operand 3 states and 1069 transitions. [2024-11-12 12:40:52,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 358 transitions, 774 flow [2024-11-12 12:40:52,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 358 transitions, 766 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 12:40:52,698 INFO L231 Difference]: Finished difference. Result has 359 places, 358 transitions, 724 flow [2024-11-12 12:40:52,701 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=359, PETRI_TRANSITIONS=358} [2024-11-12 12:40:52,705 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -3 predicate places. [2024-11-12 12:40:52,705 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 358 transitions, 724 flow [2024-11-12 12:40:52,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.3333333333333) internal successors, (1045), 3 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:52,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:52,707 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:52,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:40:52,708 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-12 12:40:52,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:52,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1606664058, now seen corresponding path program 1 times [2024-11-12 12:40:52,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:52,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333058456] [2024-11-12 12:40:52,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:52,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:52,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:52,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333058456] [2024-11-12 12:40:52,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333058456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:52,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:52,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:52,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022491785] [2024-11-12 12:40:52,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:52,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:52,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:52,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:52,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:52,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 379 [2024-11-12 12:40:52,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 358 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:52,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:52,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 379 [2024-11-12 12:40:52,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:52,998 INFO L124 PetriNetUnfolderBase]: 75/700 cut-off events. [2024-11-12 12:40:52,999 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2024-11-12 12:40:53,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 700 events. 75/700 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2516 event pairs, 33 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 590. Up to 128 conditions per place. [2024-11-12 12:40:53,002 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 20 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-12 12:40:53,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 357 transitions, 766 flow [2024-11-12 12:40:53,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1067 transitions. [2024-11-12 12:40:53,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9384344766930519 [2024-11-12 12:40:53,005 INFO L175 Difference]: Start difference. First operand has 359 places, 358 transitions, 724 flow. Second operand 3 states and 1067 transitions. [2024-11-12 12:40:53,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 357 transitions, 766 flow [2024-11-12 12:40:53,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 357 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:53,010 INFO L231 Difference]: Finished difference. Result has 358 places, 357 transitions, 722 flow [2024-11-12 12:40:53,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=722, PETRI_PLACES=358, PETRI_TRANSITIONS=357} [2024-11-12 12:40:53,013 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -4 predicate places. [2024-11-12 12:40:53,013 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 357 transitions, 722 flow [2024-11-12 12:40:53,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 349.3333333333333) internal successors, (1048), 3 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:53,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:53,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:53,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:40:53,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-12 12:40:53,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:53,017 INFO L85 PathProgramCache]: Analyzing trace with hash 563269571, now seen corresponding path program 1 times [2024-11-12 12:40:53,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:53,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693554050] [2024-11-12 12:40:53,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:53,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:53,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:53,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:53,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693554050] [2024-11-12 12:40:53,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693554050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:53,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:53,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:53,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937616997] [2024-11-12 12:40:53,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:53,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:53,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:53,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:53,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:53,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 345 out of 379 [2024-11-12 12:40:53,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 357 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 346.6666666666667) internal successors, (1040), 3 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:53,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:53,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 345 of 379 [2024-11-12 12:40:53,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:53,321 INFO L124 PetriNetUnfolderBase]: 207/1202 cut-off events. [2024-11-12 12:40:53,321 INFO L125 PetriNetUnfolderBase]: For 29/38 co-relation queries the response was YES. [2024-11-12 12:40:53,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 1202 events. 207/1202 cut-off events. For 29/38 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6055 event pairs, 55 based on Foata normal form. 1/1072 useless extension candidates. Maximal degree in co-relation 1368. Up to 266 conditions per place. [2024-11-12 12:40:53,328 INFO L140 encePairwiseOnDemand]: 365/379 looper letters, 37 selfloop transitions, 10 changer transitions 0/377 dead transitions. [2024-11-12 12:40:53,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 377 transitions, 858 flow [2024-11-12 12:40:53,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:53,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1086 transitions. [2024-11-12 12:40:53,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9551451187335093 [2024-11-12 12:40:53,332 INFO L175 Difference]: Start difference. First operand has 358 places, 357 transitions, 722 flow. Second operand 3 states and 1086 transitions. [2024-11-12 12:40:53,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 377 transitions, 858 flow [2024-11-12 12:40:53,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 377 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:53,339 INFO L231 Difference]: Finished difference. Result has 360 places, 367 transitions, 806 flow [2024-11-12 12:40:53,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=806, PETRI_PLACES=360, PETRI_TRANSITIONS=367} [2024-11-12 12:40:53,340 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -2 predicate places. [2024-11-12 12:40:53,341 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 367 transitions, 806 flow [2024-11-12 12:40:53,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 346.6666666666667) internal successors, (1040), 3 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:53,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:53,342 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:53,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:40:53,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-12 12:40:53,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:53,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1043580549, now seen corresponding path program 1 times [2024-11-12 12:40:53,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:53,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115569754] [2024-11-12 12:40:53,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:53,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:53,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:53,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115569754] [2024-11-12 12:40:53,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115569754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:53,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:53,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:40:53,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672573705] [2024-11-12 12:40:53,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:53,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:53,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:53,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:53,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:53,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 379 [2024-11-12 12:40:53,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 367 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 357.6666666666667) internal successors, (1073), 3 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:53,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:53,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 379 [2024-11-12 12:40:53,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:53,742 INFO L124 PetriNetUnfolderBase]: 266/1801 cut-off events. [2024-11-12 12:40:53,742 INFO L125 PetriNetUnfolderBase]: For 119/121 co-relation queries the response was YES. [2024-11-12 12:40:53,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2548 conditions, 1801 events. 266/1801 cut-off events. For 119/121 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 11165 event pairs, 87 based on Foata normal form. 6/1609 useless extension candidates. Maximal degree in co-relation 2027. Up to 260 conditions per place. [2024-11-12 12:40:53,749 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 24 selfloop transitions, 2 changer transitions 0/377 dead transitions. [2024-11-12 12:40:53,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 377 transitions, 879 flow [2024-11-12 12:40:53,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1095 transitions. [2024-11-12 12:40:53,751 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9630606860158312 [2024-11-12 12:40:53,752 INFO L175 Difference]: Start difference. First operand has 360 places, 367 transitions, 806 flow. Second operand 3 states and 1095 transitions. [2024-11-12 12:40:53,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 377 transitions, 879 flow [2024-11-12 12:40:53,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 377 transitions, 859 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:53,758 INFO L231 Difference]: Finished difference. Result has 361 places, 368 transitions, 798 flow [2024-11-12 12:40:53,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=786, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=361, PETRI_TRANSITIONS=368} [2024-11-12 12:40:53,759 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -1 predicate places. [2024-11-12 12:40:53,759 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 368 transitions, 798 flow [2024-11-12 12:40:53,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 357.6666666666667) internal successors, (1073), 3 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:53,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:53,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:53,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:40:53,760 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-12 12:40:53,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:53,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1070020697, now seen corresponding path program 1 times [2024-11-12 12:40:53,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:53,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893875874] [2024-11-12 12:40:53,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:53,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:53,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:53,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893875874] [2024-11-12 12:40:53,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893875874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:53,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:53,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:53,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680199482] [2024-11-12 12:40:53,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:53,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:53,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:53,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:53,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:53,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 379 [2024-11-12 12:40:53,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 368 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 351.6666666666667) internal successors, (1055), 3 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:53,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:53,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 379 [2024-11-12 12:40:53,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:54,139 INFO L124 PetriNetUnfolderBase]: 443/2130 cut-off events. [2024-11-12 12:40:54,139 INFO L125 PetriNetUnfolderBase]: For 279/326 co-relation queries the response was YES. [2024-11-12 12:40:54,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 2130 events. 443/2130 cut-off events. For 279/326 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 13603 event pairs, 166 based on Foata normal form. 15/1918 useless extension candidates. Maximal degree in co-relation 2861. Up to 688 conditions per place. [2024-11-12 12:40:54,149 INFO L140 encePairwiseOnDemand]: 372/379 looper letters, 32 selfloop transitions, 10 changer transitions 0/381 dead transitions. [2024-11-12 12:40:54,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 381 transitions, 921 flow [2024-11-12 12:40:54,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1081 transitions. [2024-11-12 12:40:54,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9507475813544415 [2024-11-12 12:40:54,152 INFO L175 Difference]: Start difference. First operand has 361 places, 368 transitions, 798 flow. Second operand 3 states and 1081 transitions. [2024-11-12 12:40:54,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 381 transitions, 921 flow [2024-11-12 12:40:54,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 381 transitions, 919 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:54,158 INFO L231 Difference]: Finished difference. Result has 364 places, 376 transitions, 882 flow [2024-11-12 12:40:54,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=364, PETRI_TRANSITIONS=376} [2024-11-12 12:40:54,160 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, 2 predicate places. [2024-11-12 12:40:54,160 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 376 transitions, 882 flow [2024-11-12 12:40:54,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 351.6666666666667) internal successors, (1055), 3 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:54,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:54,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:54,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:40:54,162 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-12 12:40:54,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash 662990335, now seen corresponding path program 1 times [2024-11-12 12:40:54,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:54,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339838391] [2024-11-12 12:40:54,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:54,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:54,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:54,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:54,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339838391] [2024-11-12 12:40:54,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339838391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:54,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:54,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:40:54,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52013247] [2024-11-12 12:40:54,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:54,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:54,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:54,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:54,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:54,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 353 out of 379 [2024-11-12 12:40:54,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 376 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:54,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:54,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 353 of 379 [2024-11-12 12:40:54,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:54,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([847] L881-6-->L880-1: Formula: (= |v_#race~num~0_1| 0) InVars {} OutVars{#race~num~0=|v_#race~num~0_1|} AuxVars[] AssignedVars[#race~num~0][294], [248#L894-2true, Black: 384#true, 400#(= ~num~0 0), 391#(= thread2Thread1of1ForFork0_~j~0 0), 226#L880-1true, Black: 395#(= |thread1Thread1of1ForFork1_#t~nondet8| |#race~num~0|), 159#L914-4true, 393#true]) [2024-11-12 12:40:54,409 INFO L294 olderBase$Statistics]: this new event has 304 ancestors and is cut-off event [2024-11-12 12:40:54,409 INFO L297 olderBase$Statistics]: existing Event has 299 ancestors and is cut-off event [2024-11-12 12:40:54,410 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-12 12:40:54,410 INFO L297 olderBase$Statistics]: existing Event has 274 ancestors and is cut-off event [2024-11-12 12:40:54,551 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([847] L881-6-->L880-1: Formula: (= |v_#race~num~0_1| 0) InVars {} OutVars{#race~num~0=|v_#race~num~0_1|} AuxVars[] AssignedVars[#race~num~0][294], [248#L894-2true, Black: 384#true, 398#true, Black: 391#(= thread2Thread1of1ForFork0_~j~0 0), 226#L880-1true, Black: 395#(= |thread1Thread1of1ForFork1_#t~nondet8| |#race~num~0|), 159#L914-4true, 393#true]) [2024-11-12 12:40:54,551 INFO L294 olderBase$Statistics]: this new event has 346 ancestors and is cut-off event [2024-11-12 12:40:54,551 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2024-11-12 12:40:54,551 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-12 12:40:54,552 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-12 12:40:54,596 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([847] L881-6-->L880-1: Formula: (= |v_#race~num~0_1| 0) InVars {} OutVars{#race~num~0=|v_#race~num~0_1|} AuxVars[] AssignedVars[#race~num~0][294], [248#L894-2true, Black: 384#true, 398#true, Black: 391#(= thread2Thread1of1ForFork0_~j~0 0), 226#L880-1true, Black: 395#(= |thread1Thread1of1ForFork1_#t~nondet8| |#race~num~0|), 159#L914-4true, 393#true]) [2024-11-12 12:40:54,596 INFO L294 olderBase$Statistics]: this new event has 351 ancestors and is cut-off event [2024-11-12 12:40:54,597 INFO L297 olderBase$Statistics]: existing Event has 326 ancestors and is cut-off event [2024-11-12 12:40:54,597 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-12 12:40:54,597 INFO L297 olderBase$Statistics]: existing Event has 321 ancestors and is cut-off event [2024-11-12 12:40:54,597 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-11-12 12:40:54,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([847] L881-6-->L880-1: Formula: (= |v_#race~num~0_1| 0) InVars {} OutVars{#race~num~0=|v_#race~num~0_1|} AuxVars[] AssignedVars[#race~num~0][294], [Black: 384#true, 398#true, Black: 391#(= thread2Thread1of1ForFork0_~j~0 0), 226#L880-1true, Black: 395#(= |thread1Thread1of1ForFork1_#t~nondet8| |#race~num~0|), 159#L914-4true, 228#L894-1true, 393#true]) [2024-11-12 12:40:54,598 INFO L294 olderBase$Statistics]: this new event has 350 ancestors and is cut-off event [2024-11-12 12:40:54,598 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-11-12 12:40:54,598 INFO L297 olderBase$Statistics]: existing Event has 320 ancestors and is cut-off event [2024-11-12 12:40:54,598 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2024-11-12 12:40:54,600 INFO L124 PetriNetUnfolderBase]: 542/2486 cut-off events. [2024-11-12 12:40:54,600 INFO L125 PetriNetUnfolderBase]: For 440/478 co-relation queries the response was YES. [2024-11-12 12:40:54,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4134 conditions, 2486 events. 542/2486 cut-off events. For 440/478 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 15992 event pairs, 154 based on Foata normal form. 21/2209 useless extension candidates. Maximal degree in co-relation 3514. Up to 449 conditions per place. [2024-11-12 12:40:54,611 INFO L140 encePairwiseOnDemand]: 374/379 looper letters, 27 selfloop transitions, 3 changer transitions 0/387 dead transitions. [2024-11-12 12:40:54,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 387 transitions, 966 flow [2024-11-12 12:40:54,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:54,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:54,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1091 transitions. [2024-11-12 12:40:54,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9595426561125769 [2024-11-12 12:40:54,614 INFO L175 Difference]: Start difference. First operand has 364 places, 376 transitions, 882 flow. Second operand 3 states and 1091 transitions. [2024-11-12 12:40:54,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 387 transitions, 966 flow [2024-11-12 12:40:54,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 387 transitions, 946 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:54,622 INFO L231 Difference]: Finished difference. Result has 366 places, 378 transitions, 886 flow [2024-11-12 12:40:54,623 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=366, PETRI_TRANSITIONS=378} [2024-11-12 12:40:54,625 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, 4 predicate places. [2024-11-12 12:40:54,625 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 378 transitions, 886 flow [2024-11-12 12:40:54,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 355.0) internal successors, (1065), 3 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:54,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:54,626 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:54,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:40:54,626 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-12 12:40:54,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:54,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1436826995, now seen corresponding path program 1 times [2024-11-12 12:40:54,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:54,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913931267] [2024-11-12 12:40:54,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:54,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:54,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:54,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913931267] [2024-11-12 12:40:54,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913931267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:54,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:54,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:40:54,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119625282] [2024-11-12 12:40:54,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:54,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:54,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:54,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:54,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:54,844 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 358 out of 379 [2024-11-12 12:40:54,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 378 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:54,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:54,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 358 of 379 [2024-11-12 12:40:54,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:54,963 INFO L124 PetriNetUnfolderBase]: 51/770 cut-off events. [2024-11-12 12:40:54,965 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-11-12 12:40:54,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 770 events. 51/770 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2186 event pairs, 7 based on Foata normal form. 22/759 useless extension candidates. Maximal degree in co-relation 553. Up to 87 conditions per place. [2024-11-12 12:40:54,967 INFO L140 encePairwiseOnDemand]: 371/379 looper letters, 8 selfloop transitions, 8 changer transitions 0/359 dead transitions. [2024-11-12 12:40:54,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 359 transitions, 822 flow [2024-11-12 12:40:54,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1094 transitions. [2024-11-12 12:40:54,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621811785400176 [2024-11-12 12:40:54,969 INFO L175 Difference]: Start difference. First operand has 366 places, 378 transitions, 886 flow. Second operand 3 states and 1094 transitions. [2024-11-12 12:40:54,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 359 transitions, 822 flow [2024-11-12 12:40:54,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 359 transitions, 790 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-11-12 12:40:54,975 INFO L231 Difference]: Finished difference. Result has 359 places, 357 transitions, 768 flow [2024-11-12 12:40:54,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=359, PETRI_TRANSITIONS=357} [2024-11-12 12:40:54,977 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -3 predicate places. [2024-11-12 12:40:54,977 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 357 transitions, 768 flow [2024-11-12 12:40:54,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 360.0) internal successors, (1080), 3 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:54,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:54,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:54,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:40:54,978 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-12 12:40:54,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:54,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1408103733, now seen corresponding path program 1 times [2024-11-12 12:40:54,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:54,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980569965] [2024-11-12 12:40:54,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:54,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:55,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:55,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980569965] [2024-11-12 12:40:55,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980569965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:55,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:55,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:55,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486771429] [2024-11-12 12:40:55,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:55,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:55,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:55,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:55,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:55,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 379 [2024-11-12 12:40:55,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 357 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 350.6666666666667) internal successors, (1052), 3 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:55,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:55,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 379 [2024-11-12 12:40:55,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:55,220 INFO L124 PetriNetUnfolderBase]: 80/845 cut-off events. [2024-11-12 12:40:55,220 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-12 12:40:55,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 845 events. 80/845 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2877 event pairs, 22 based on Foata normal form. 1/813 useless extension candidates. Maximal degree in co-relation 674. Up to 115 conditions per place. [2024-11-12 12:40:55,224 INFO L140 encePairwiseOnDemand]: 371/379 looper letters, 20 selfloop transitions, 4 changer transitions 3/359 dead transitions. [2024-11-12 12:40:55,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 359 transitions, 831 flow [2024-11-12 12:40:55,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:55,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1072 transitions. [2024-11-12 12:40:55,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428320140721196 [2024-11-12 12:40:55,226 INFO L175 Difference]: Start difference. First operand has 359 places, 357 transitions, 768 flow. Second operand 3 states and 1072 transitions. [2024-11-12 12:40:55,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 359 transitions, 831 flow [2024-11-12 12:40:55,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 359 transitions, 819 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:55,231 INFO L231 Difference]: Finished difference. Result has 357 places, 351 transitions, 756 flow [2024-11-12 12:40:55,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=357, PETRI_TRANSITIONS=351} [2024-11-12 12:40:55,232 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -5 predicate places. [2024-11-12 12:40:55,232 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 351 transitions, 756 flow [2024-11-12 12:40:55,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 350.6666666666667) internal successors, (1052), 3 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:55,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:55,233 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:55,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:40:55,234 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-12 12:40:55,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash -64203076, now seen corresponding path program 1 times [2024-11-12 12:40:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:55,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220829097] [2024-11-12 12:40:55,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:55,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:55,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:55,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220829097] [2024-11-12 12:40:55,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220829097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:55,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:55,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:55,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284223632] [2024-11-12 12:40:55,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:55,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:55,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:55,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:55,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:55,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 379 [2024-11-12 12:40:55,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 351 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:55,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:55,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 379 [2024-11-12 12:40:55,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:55,435 INFO L124 PetriNetUnfolderBase]: 75/808 cut-off events. [2024-11-12 12:40:55,435 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2024-11-12 12:40:55,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 808 events. 75/808 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2689 event pairs, 29 based on Foata normal form. 0/784 useless extension candidates. Maximal degree in co-relation 598. Up to 142 conditions per place. [2024-11-12 12:40:55,439 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 19 selfloop transitions, 2 changer transitions 0/351 dead transitions. [2024-11-12 12:40:55,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 351 transitions, 799 flow [2024-11-12 12:40:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1072 transitions. [2024-11-12 12:40:55,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428320140721196 [2024-11-12 12:40:55,442 INFO L175 Difference]: Start difference. First operand has 357 places, 351 transitions, 756 flow. Second operand 3 states and 1072 transitions. [2024-11-12 12:40:55,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 351 transitions, 799 flow [2024-11-12 12:40:55,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 351 transitions, 791 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:55,447 INFO L231 Difference]: Finished difference. Result has 353 places, 350 transitions, 750 flow [2024-11-12 12:40:55,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=353, PETRI_TRANSITIONS=350} [2024-11-12 12:40:55,448 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -9 predicate places. [2024-11-12 12:40:55,448 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 350 transitions, 750 flow [2024-11-12 12:40:55,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 353.3333333333333) internal successors, (1060), 3 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:55,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:55,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:55,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:40:55,450 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-12 12:40:55,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:55,451 INFO L85 PathProgramCache]: Analyzing trace with hash 912439908, now seen corresponding path program 1 times [2024-11-12 12:40:55,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:55,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241828114] [2024-11-12 12:40:55,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:55,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:55,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:55,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241828114] [2024-11-12 12:40:55,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241828114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:55,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:55,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:55,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651925545] [2024-11-12 12:40:55,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:55,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:55,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:55,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:55,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:55,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 379 [2024-11-12 12:40:55,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 350 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:55,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:55,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 379 [2024-11-12 12:40:55,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:55,636 INFO L124 PetriNetUnfolderBase]: 71/763 cut-off events. [2024-11-12 12:40:55,636 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-11-12 12:40:55,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 763 events. 71/763 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2309 event pairs, 30 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 611. Up to 176 conditions per place. [2024-11-12 12:40:55,639 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 23 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2024-11-12 12:40:55,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 350 transitions, 801 flow [2024-11-12 12:40:55,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:55,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1071 transitions. [2024-11-12 12:40:55,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.941952506596306 [2024-11-12 12:40:55,641 INFO L175 Difference]: Start difference. First operand has 353 places, 350 transitions, 750 flow. Second operand 3 states and 1071 transitions. [2024-11-12 12:40:55,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 350 transitions, 801 flow [2024-11-12 12:40:55,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 350 transitions, 797 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:55,646 INFO L231 Difference]: Finished difference. Result has 352 places, 349 transitions, 748 flow [2024-11-12 12:40:55,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=352, PETRI_TRANSITIONS=349} [2024-11-12 12:40:55,647 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -10 predicate places. [2024-11-12 12:40:55,647 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 349 transitions, 748 flow [2024-11-12 12:40:55,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 353.6666666666667) internal successors, (1061), 3 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:55,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:55,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:55,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:40:55,649 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-12 12:40:55,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:55,650 INFO L85 PathProgramCache]: Analyzing trace with hash 216970297, now seen corresponding path program 1 times [2024-11-12 12:40:55,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:55,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254541677] [2024-11-12 12:40:55,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:55,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:55,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:55,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:55,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254541677] [2024-11-12 12:40:55,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254541677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:40:55,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94315701] [2024-11-12 12:40:55,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:55,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:40:55,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:40:55,811 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-12 12:40:55,812 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-12 12:40:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:56,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 12:40:56,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:40:56,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 12:40:56,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:40:56,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94315701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:56,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 12:40:56,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-12 12:40:56,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476291072] [2024-11-12 12:40:56,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:56,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:56,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:56,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:56,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:56,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 379 [2024-11-12 12:40:56,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 349 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 354.3333333333333) internal successors, (1063), 3 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:56,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:56,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 379 [2024-11-12 12:40:56,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:56,197 INFO L124 PetriNetUnfolderBase]: 92/891 cut-off events. [2024-11-12 12:40:56,198 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-12 12:40:56,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1247 conditions, 891 events. 92/891 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3188 event pairs, 32 based on Foata normal form. 0/869 useless extension candidates. Maximal degree in co-relation 727. Up to 149 conditions per place. [2024-11-12 12:40:56,201 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 23 selfloop transitions, 2 changer transitions 0/353 dead transitions. [2024-11-12 12:40:56,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 353 transitions, 811 flow [2024-11-12 12:40:56,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:56,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:56,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1076 transitions. [2024-11-12 12:40:56,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9463500439753738 [2024-11-12 12:40:56,204 INFO L175 Difference]: Start difference. First operand has 352 places, 349 transitions, 748 flow. Second operand 3 states and 1076 transitions. [2024-11-12 12:40:56,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 353 transitions, 811 flow [2024-11-12 12:40:56,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 353 transitions, 807 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:56,209 INFO L231 Difference]: Finished difference. Result has 351 places, 348 transitions, 746 flow [2024-11-12 12:40:56,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=746, PETRI_PLACES=351, PETRI_TRANSITIONS=348} [2024-11-12 12:40:56,210 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -11 predicate places. [2024-11-12 12:40:56,210 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 348 transitions, 746 flow [2024-11-12 12:40:56,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 354.3333333333333) internal successors, (1063), 3 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:56,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:56,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:56,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 12:40:56,412 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,SelfDestructingSolverStorable10 [2024-11-12 12:40:56,412 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-12 12:40:56,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:56,413 INFO L85 PathProgramCache]: Analyzing trace with hash -433418165, now seen corresponding path program 1 times [2024-11-12 12:40:56,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:56,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74781189] [2024-11-12 12:40:56,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:56,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:56,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:56,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74781189] [2024-11-12 12:40:56,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74781189] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:40:56,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134936772] [2024-11-12 12:40:56,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:56,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:40:56,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:40:56,626 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-12 12:40:56,627 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-12 12:40:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:56,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 12:40:56,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:40:56,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 12:40:56,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:40:56,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134936772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:56,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 12:40:56,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-12 12:40:56,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630840220] [2024-11-12 12:40:56,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:56,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:56,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:56,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:56,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:56,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 379 [2024-11-12 12:40:56,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 348 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:56,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:56,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 379 [2024-11-12 12:40:56,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:57,013 INFO L124 PetriNetUnfolderBase]: 81/842 cut-off events. [2024-11-12 12:40:57,013 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-12 12:40:57,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1157 conditions, 842 events. 81/842 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2753 event pairs, 24 based on Foata normal form. 0/823 useless extension candidates. Maximal degree in co-relation 918. Up to 121 conditions per place. [2024-11-12 12:40:57,017 INFO L140 encePairwiseOnDemand]: 376/379 looper letters, 20 selfloop transitions, 2 changer transitions 0/352 dead transitions. [2024-11-12 12:40:57,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 352 transitions, 803 flow [2024-11-12 12:40:57,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:57,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1085 transitions. [2024-11-12 12:40:57,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9542656112576957 [2024-11-12 12:40:57,019 INFO L175 Difference]: Start difference. First operand has 351 places, 348 transitions, 746 flow. Second operand 3 states and 1085 transitions. [2024-11-12 12:40:57,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 352 transitions, 803 flow [2024-11-12 12:40:57,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 352 transitions, 799 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:57,024 INFO L231 Difference]: Finished difference. Result has 350 places, 347 transitions, 744 flow [2024-11-12 12:40:57,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=350, PETRI_TRANSITIONS=347} [2024-11-12 12:40:57,026 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -12 predicate places. [2024-11-12 12:40:57,026 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 347 transitions, 744 flow [2024-11-12 12:40:57,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 357.0) internal successors, (1071), 3 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:57,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:57,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:57,044 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-12 12:40:57,227 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,SelfDestructingSolverStorable11 [2024-11-12 12:40:57,228 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-12 12:40:57,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:57,231 INFO L85 PathProgramCache]: Analyzing trace with hash 816575416, now seen corresponding path program 1 times [2024-11-12 12:40:57,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:57,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195896664] [2024-11-12 12:40:57,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:57,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 12:40:57,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:57,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195896664] [2024-11-12 12:40:57,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195896664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:57,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:57,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:57,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223102465] [2024-11-12 12:40:57,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:57,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:40:57,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:57,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:40:57,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:40:57,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 379 [2024-11-12 12:40:57,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 347 transitions, 744 flow. Second operand has 5 states, 5 states have (on average 356.8) internal successors, (1784), 5 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:57,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:57,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 379 [2024-11-12 12:40:57,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:57,675 INFO L124 PetriNetUnfolderBase]: 200/1540 cut-off events. [2024-11-12 12:40:57,675 INFO L125 PetriNetUnfolderBase]: For 83/94 co-relation queries the response was YES. [2024-11-12 12:40:57,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2275 conditions, 1540 events. 200/1540 cut-off events. For 83/94 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7618 event pairs, 51 based on Foata normal form. 17/1517 useless extension candidates. Maximal degree in co-relation 2229. Up to 213 conditions per place. [2024-11-12 12:40:57,682 INFO L140 encePairwiseOnDemand]: 374/379 looper letters, 44 selfloop transitions, 5 changer transitions 0/378 dead transitions. [2024-11-12 12:40:57,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 378 transitions, 930 flow [2024-11-12 12:40:57,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:57,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2175 transitions. [2024-11-12 12:40:57,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9564643799472295 [2024-11-12 12:40:57,686 INFO L175 Difference]: Start difference. First operand has 350 places, 347 transitions, 744 flow. Second operand 6 states and 2175 transitions. [2024-11-12 12:40:57,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 378 transitions, 930 flow [2024-11-12 12:40:57,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 378 transitions, 926 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:57,691 INFO L231 Difference]: Finished difference. Result has 356 places, 351 transitions, 774 flow [2024-11-12 12:40:57,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=774, PETRI_PLACES=356, PETRI_TRANSITIONS=351} [2024-11-12 12:40:57,693 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -6 predicate places. [2024-11-12 12:40:57,693 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 351 transitions, 774 flow [2024-11-12 12:40:57,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 356.8) internal successors, (1784), 5 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:57,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:57,694 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:57,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:40:57,695 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err5ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-12 12:40:57,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:57,696 INFO L85 PathProgramCache]: Analyzing trace with hash 141064472, now seen corresponding path program 2 times [2024-11-12 12:40:57,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:57,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236919981] [2024-11-12 12:40:57,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:57,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 12:40:57,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:57,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236919981] [2024-11-12 12:40:57,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236919981] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:40:57,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518740833] [2024-11-12 12:40:57,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 12:40:57,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:40:57,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:40:57,865 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-12 12:40:57,867 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-12 12:40:58,082 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 12:40:58,083 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:40:58,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 12:40:58,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:40:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-12 12:40:58,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:40:58,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518740833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:58,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 12:40:58,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-12 12:40:58,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279148109] [2024-11-12 12:40:58,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:58,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:58,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:58,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:58,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:58,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 379 [2024-11-12 12:40:58,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 351 transitions, 774 flow. Second operand has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:58,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:58,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 379 [2024-11-12 12:40:58,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:58,247 INFO L124 PetriNetUnfolderBase]: 92/1200 cut-off events. [2024-11-12 12:40:58,247 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-12 12:40:58,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1679 conditions, 1200 events. 92/1200 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5297 event pairs, 35 based on Foata normal form. 1/1182 useless extension candidates. Maximal degree in co-relation 1124. Up to 174 conditions per place. [2024-11-12 12:40:58,252 INFO L140 encePairwiseOnDemand]: 377/379 looper letters, 0 selfloop transitions, 0 changer transitions 350/350 dead transitions. [2024-11-12 12:40:58,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 350 transitions, 800 flow [2024-11-12 12:40:58,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:58,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1083 transitions. [2024-11-12 12:40:58,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9525065963060686 [2024-11-12 12:40:58,254 INFO L175 Difference]: Start difference. First operand has 356 places, 351 transitions, 774 flow. Second operand 3 states and 1083 transitions. [2024-11-12 12:40:58,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 350 transitions, 800 flow [2024-11-12 12:40:58,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 350 transitions, 800 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:40:58,258 INFO L231 Difference]: Finished difference. Result has 357 places, 0 transitions, 0 flow [2024-11-12 12:40:58,258 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=379, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=357, PETRI_TRANSITIONS=0} [2024-11-12 12:40:58,258 INFO L279 CegarLoopForPetriNet]: 362 programPoint places, -5 predicate places. [2024-11-12 12:40:58,259 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 0 transitions, 0 flow [2024-11-12 12:40:58,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 359.6666666666667) internal successors, (1079), 3 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:58,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 28 remaining) [2024-11-12 12:40:58,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 28 remaining) [2024-11-12 12:40:58,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (25 of 28 remaining) [2024-11-12 12:40:58,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (24 of 28 remaining) [2024-11-12 12:40:58,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 28 remaining) [2024-11-12 12:40:58,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 28 remaining) [2024-11-12 12:40:58,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (21 of 28 remaining) [2024-11-12 12:40:58,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (20 of 28 remaining) [2024-11-12 12:40:58,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (19 of 28 remaining) [2024-11-12 12:40:58,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (18 of 28 remaining) [2024-11-12 12:40:58,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (17 of 28 remaining) [2024-11-12 12:40:58,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 28 remaining) [2024-11-12 12:40:58,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 28 remaining) [2024-11-12 12:40:58,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 28 remaining) [2024-11-12 12:40:58,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (13 of 28 remaining) [2024-11-12 12:40:58,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 28 remaining) [2024-11-12 12:40:58,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 28 remaining) [2024-11-12 12:40:58,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (10 of 28 remaining) [2024-11-12 12:40:58,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (9 of 28 remaining) [2024-11-12 12:40:58,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (8 of 28 remaining) [2024-11-12 12:40:58,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (7 of 28 remaining) [2024-11-12 12:40:58,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 28 remaining) [2024-11-12 12:40:58,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (5 of 28 remaining) [2024-11-12 12:40:58,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (4 of 28 remaining) [2024-11-12 12:40:58,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (3 of 28 remaining) [2024-11-12 12:40:58,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (2 of 28 remaining) [2024-11-12 12:40:58,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (1 of 28 remaining) [2024-11-12 12:40:58,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (0 of 28 remaining) [2024-11-12 12:40:58,283 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-12 12:40:58,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:40:58,466 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:58,470 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 12:40:58,471 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:40:58,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:40:58 BasicIcfg [2024-11-12 12:40:58,475 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:40:58,475 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:40:58,475 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:40:58,475 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:40:58,476 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:51" (3/4) ... [2024-11-12 12:40:58,477 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 12:40:58,479 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-12 12:40:58,480 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-12 12:40:58,485 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-12 12:40:58,485 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-12 12:40:58,485 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 12:40:58,486 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 12:40:58,564 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:40:58,564 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 12:40:58,564 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:40:58,565 INFO L158 Benchmark]: Toolchain (without parser) took 8324.49ms. Allocated memory was 134.2MB in the beginning and 453.0MB in the end (delta: 318.8MB). Free memory was 59.3MB in the beginning and 305.1MB in the end (delta: -245.7MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2024-11-12 12:40:58,565 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 134.2MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:40:58,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.59ms. Allocated memory was 134.2MB in the beginning and 192.9MB in the end (delta: 58.7MB). Free memory was 59.2MB in the beginning and 141.4MB in the end (delta: -82.2MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2024-11-12 12:40:58,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.68ms. Allocated memory is still 192.9MB. Free memory was 141.4MB in the beginning and 138.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:40:58,566 INFO L158 Benchmark]: Boogie Preprocessor took 58.86ms. Allocated memory is still 192.9MB. Free memory was 138.3MB in the beginning and 135.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 12:40:58,566 INFO L158 Benchmark]: RCFGBuilder took 625.68ms. Allocated memory is still 192.9MB. Free memory was 135.0MB in the beginning and 105.8MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-12 12:40:58,566 INFO L158 Benchmark]: TraceAbstraction took 6912.23ms. Allocated memory was 192.9MB in the beginning and 453.0MB in the end (delta: 260.0MB). Free memory was 104.8MB in the beginning and 312.5MB in the end (delta: -207.7MB). Peak memory consumption was 240.0MB. Max. memory is 16.1GB. [2024-11-12 12:40:58,566 INFO L158 Benchmark]: Witness Printer took 89.26ms. Allocated memory is still 453.0MB. Free memory was 312.5MB in the beginning and 305.1MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 12:40:58,567 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.13ms. Allocated memory is still 134.2MB. Free memory is still 83.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 562.59ms. Allocated memory was 134.2MB in the beginning and 192.9MB in the end (delta: 58.7MB). Free memory was 59.2MB in the beginning and 141.4MB in the end (delta: -82.2MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.68ms. Allocated memory is still 192.9MB. Free memory was 141.4MB in the beginning and 138.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.86ms. Allocated memory is still 192.9MB. Free memory was 138.3MB in the beginning and 135.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 625.68ms. Allocated memory is still 192.9MB. Free memory was 135.0MB in the beginning and 105.8MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6912.23ms. Allocated memory was 192.9MB in the beginning and 453.0MB in the end (delta: 260.0MB). Free memory was 104.8MB in the beginning and 312.5MB in the end (delta: -207.7MB). Peak memory consumption was 240.0MB. Max. memory is 16.1GB. * Witness Printer took 89.26ms. Allocated memory is still 453.0MB. Free memory was 312.5MB in the beginning and 305.1MB in the end (delta: 7.4MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 880]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 882]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 882]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 902]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 894]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 896]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 902]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 896]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 903]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 897]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 897]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 908]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 909]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 917]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 918]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 457 locations, 28 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: 6.8s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 446 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 744 IncrementalHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 78 mSDtfsCounter, 744 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1035 GetRequests, 1008 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=886occurred in iteration=6, InterpolantAutomatonStates: 45, 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.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 5037 NumberOfCodeBlocks, 4990 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 5020 ConstructedInterpolants, 0 QuantifiedInterpolants, 5424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1970 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 38/45 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-12 12:40:58,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE