./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:37:36,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:37:36,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:37:36,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:37:36,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:37:36,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:37:36,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:37:36,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:37:36,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:37:36,590 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:37:36,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:37:36,591 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:37:36,591 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:37:36,591 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:37:36,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:37:36,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:37:36,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:37:36,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:37:36,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:37:36,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:37:36,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:37:36,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:37:36,599 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:37:36,599 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:37:36,600 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:37:36,600 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:37:36,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:37:36,600 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:37:36,600 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:37:36,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:37:36,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:37:36,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:37:36,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:37:36,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:37:36,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:37:36,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:37:36,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:37:36,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:37:36,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:37:36,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:37:36,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:37:36,605 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 -> 9cb2b0cbecf02e8cce2fd890595fb88c3204482a27ce7ac6f4ef6fb92949d747 [2024-11-10 14:37:36,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:37:36,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:37:36,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:37:36,917 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:37:36,918 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:37:36,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2024-11-10 14:37:38,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:37:38,606 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:37:38,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2024-11-10 14:37:38,621 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d794543a/928d304e8b7146788aa7c24d483903f2/FLAGf42bde6b7 [2024-11-10 14:37:38,979 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d794543a/928d304e8b7146788aa7c24d483903f2 [2024-11-10 14:37:38,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:37:38,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:37:38,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:37:38,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:37:38,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:37:38,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:37:38" (1/1) ... [2024-11-10 14:37:38,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3989e033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:38, skipping insertion in model container [2024-11-10 14:37:38,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:37:38" (1/1) ... [2024-11-10 14:37:39,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:37:39,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:37:39,319 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:37:39,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:37:39,395 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:37:39,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:39 WrapperNode [2024-11-10 14:37:39,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:37:39,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:37:39,398 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:37:39,398 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:37:39,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:39" (1/1) ... [2024-11-10 14:37:39,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:39" (1/1) ... [2024-11-10 14:37:39,453 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 241 [2024-11-10 14:37:39,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:37:39,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:37:39,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:37:39,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:37:39,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:39" (1/1) ... [2024-11-10 14:37:39,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:39" (1/1) ... [2024-11-10 14:37:39,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:39" (1/1) ... [2024-11-10 14:37:39,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:39" (1/1) ... [2024-11-10 14:37:39,488 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:39" (1/1) ... [2024-11-10 14:37:39,490 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:39" (1/1) ... [2024-11-10 14:37:39,492 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:39" (1/1) ... [2024-11-10 14:37:39,494 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:39" (1/1) ... [2024-11-10 14:37:39,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:37:39,499 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:37:39,499 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:37:39,500 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:37:39,500 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:39" (1/1) ... [2024-11-10 14:37:39,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:37:39,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:37:39,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:37:39,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:37:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:37:39,602 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:37:39,603 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:37:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:37:39,603 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:37:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 14:37:39,603 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 14:37:39,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:37:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:37:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:37:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:37:39,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:37:39,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:37:39,606 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:37:39,759 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:37:39,761 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:37:40,541 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:37:40,541 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:37:40,595 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:37:40,596 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:37:40,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:37:40 BoogieIcfgContainer [2024-11-10 14:37:40,596 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:37:40,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:37:40,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:37:40,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:37:40,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:37:38" (1/3) ... [2024-11-10 14:37:40,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365a19de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:37:40, skipping insertion in model container [2024-11-10 14:37:40,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:39" (2/3) ... [2024-11-10 14:37:40,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365a19de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:37:40, skipping insertion in model container [2024-11-10 14:37:40,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:37:40" (3/3) ... [2024-11-10 14:37:40,631 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2024-11-10 14:37:40,667 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:37:40,667 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 75 error locations. [2024-11-10 14:37:40,667 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:37:40,854 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:37:40,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 626 places, 649 transitions, 1319 flow [2024-11-10 14:37:41,209 INFO L124 PetriNetUnfolderBase]: 33/646 cut-off events. [2024-11-10 14:37:41,210 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:37:41,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 646 events. 33/646 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1788 event pairs, 0 based on Foata normal form. 0/538 useless extension candidates. Maximal degree in co-relation 496. Up to 3 conditions per place. [2024-11-10 14:37:41,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 626 places, 649 transitions, 1319 flow [2024-11-10 14:37:41,249 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 604 places, 625 transitions, 1268 flow [2024-11-10 14:37:41,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:37:41,271 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;@6113172c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:37:41,274 INFO L334 AbstractCegarLoop]: Starting to check reachability of 135 error locations. [2024-11-10 14:37:41,278 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:37:41,278 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-11-10 14:37:41,281 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:37:41,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:41,282 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:41,282 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:41,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:41,288 INFO L85 PathProgramCache]: Analyzing trace with hash 682686636, now seen corresponding path program 1 times [2024-11-10 14:37:41,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:41,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442458598] [2024-11-10 14:37:41,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:41,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:41,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:41,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442458598] [2024-11-10 14:37:41,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442458598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:41,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:41,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:41,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339727146] [2024-11-10 14:37:41,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:41,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:41,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:41,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:41,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:41,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 649 [2024-11-10 14:37:41,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 625 transitions, 1268 flow. Second operand has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:41,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:41,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 649 [2024-11-10 14:37:41,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:41,967 INFO L124 PetriNetUnfolderBase]: 51/1068 cut-off events. [2024-11-10 14:37:41,968 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-10 14:37:41,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 1068 events. 51/1068 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5306 event pairs, 12 based on Foata normal form. 30/901 useless extension candidates. Maximal degree in co-relation 832. Up to 38 conditions per place. [2024-11-10 14:37:41,999 INFO L140 encePairwiseOnDemand]: 634/649 looper letters, 13 selfloop transitions, 2 changer transitions 6/612 dead transitions. [2024-11-10 14:37:41,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 612 transitions, 1272 flow [2024-11-10 14:37:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:42,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1882 transitions. [2024-11-10 14:37:42,026 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9666153055983564 [2024-11-10 14:37:42,028 INFO L175 Difference]: Start difference. First operand has 604 places, 625 transitions, 1268 flow. Second operand 3 states and 1882 transitions. [2024-11-10 14:37:42,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 612 transitions, 1272 flow [2024-11-10 14:37:42,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 612 transitions, 1260 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 14:37:42,050 INFO L231 Difference]: Finished difference. Result has 599 places, 606 transitions, 1222 flow [2024-11-10 14:37:42,053 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1222, PETRI_PLACES=599, PETRI_TRANSITIONS=606} [2024-11-10 14:37:42,056 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -5 predicate places. [2024-11-10 14:37:42,057 INFO L471 AbstractCegarLoop]: Abstraction has has 599 places, 606 transitions, 1222 flow [2024-11-10 14:37:42,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:42,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:42,058 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:42,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:37:42,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:42,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:42,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1326665840, now seen corresponding path program 1 times [2024-11-10 14:37:42,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:42,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428160260] [2024-11-10 14:37:42,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:42,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:42,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:42,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428160260] [2024-11-10 14:37:42,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428160260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:42,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:42,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:42,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581315520] [2024-11-10 14:37:42,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:42,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:42,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:42,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:42,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:42,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 649 [2024-11-10 14:37:42,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 606 transitions, 1222 flow. Second operand has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:42,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:42,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 649 [2024-11-10 14:37:42,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:42,526 INFO L124 PetriNetUnfolderBase]: 79/1493 cut-off events. [2024-11-10 14:37:42,527 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:37:42,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 1493 events. 79/1493 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 9157 event pairs, 20 based on Foata normal form. 0/1208 useless extension candidates. Maximal degree in co-relation 1525. Up to 50 conditions per place. [2024-11-10 14:37:42,563 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/605 dead transitions. [2024-11-10 14:37:42,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 605 transitions, 1250 flow [2024-11-10 14:37:42,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:42,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:42,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-11-10 14:37:42,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96045197740113 [2024-11-10 14:37:42,570 INFO L175 Difference]: Start difference. First operand has 599 places, 606 transitions, 1222 flow. Second operand 3 states and 1870 transitions. [2024-11-10 14:37:42,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 605 transitions, 1250 flow [2024-11-10 14:37:42,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 605 transitions, 1246 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:42,579 INFO L231 Difference]: Finished difference. Result has 592 places, 605 transitions, 1220 flow [2024-11-10 14:37:42,581 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1216, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1220, PETRI_PLACES=592, PETRI_TRANSITIONS=605} [2024-11-10 14:37:42,581 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -12 predicate places. [2024-11-10 14:37:42,582 INFO L471 AbstractCegarLoop]: Abstraction has has 592 places, 605 transitions, 1220 flow [2024-11-10 14:37:42,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:42,583 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:42,584 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:42,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:37:42,584 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:42,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:42,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1485039779, now seen corresponding path program 1 times [2024-11-10 14:37:42,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:42,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476781994] [2024-11-10 14:37:42,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:42,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:42,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:42,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:42,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476781994] [2024-11-10 14:37:42,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476781994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:42,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:42,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:42,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242184592] [2024-11-10 14:37:42,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:42,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:42,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:42,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:42,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:42,688 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 649 [2024-11-10 14:37:42,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 605 transitions, 1220 flow. Second operand has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:42,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:42,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 649 [2024-11-10 14:37:42,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:42,949 INFO L124 PetriNetUnfolderBase]: 79/1480 cut-off events. [2024-11-10 14:37:42,950 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-11-10 14:37:42,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1541 conditions, 1480 events. 79/1480 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8468 event pairs, 20 based on Foata normal form. 0/1202 useless extension candidates. Maximal degree in co-relation 1496. Up to 50 conditions per place. [2024-11-10 14:37:42,981 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/604 dead transitions. [2024-11-10 14:37:42,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 604 transitions, 1248 flow [2024-11-10 14:37:42,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:42,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-11-10 14:37:42,986 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96045197740113 [2024-11-10 14:37:42,986 INFO L175 Difference]: Start difference. First operand has 592 places, 605 transitions, 1220 flow. Second operand 3 states and 1870 transitions. [2024-11-10 14:37:42,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 604 transitions, 1248 flow [2024-11-10 14:37:42,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 604 transitions, 1244 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:42,995 INFO L231 Difference]: Finished difference. Result has 591 places, 604 transitions, 1218 flow [2024-11-10 14:37:42,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1218, PETRI_PLACES=591, PETRI_TRANSITIONS=604} [2024-11-10 14:37:42,997 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -13 predicate places. [2024-11-10 14:37:42,997 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 604 transitions, 1218 flow [2024-11-10 14:37:42,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:42,999 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:42,999 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:42,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:37:43,000 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:43,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:43,001 INFO L85 PathProgramCache]: Analyzing trace with hash 373152624, now seen corresponding path program 1 times [2024-11-10 14:37:43,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:43,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750140948] [2024-11-10 14:37:43,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:43,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:43,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:43,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750140948] [2024-11-10 14:37:43,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750140948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:43,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:43,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:43,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062885132] [2024-11-10 14:37:43,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:43,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:43,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:43,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:43,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:43,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 617 out of 649 [2024-11-10 14:37:43,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 604 transitions, 1218 flow. Second operand has 3 states, 3 states have (on average 618.3333333333334) internal successors, (1855), 3 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:43,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:43,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 617 of 649 [2024-11-10 14:37:43,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:43,348 INFO L124 PetriNetUnfolderBase]: 51/1085 cut-off events. [2024-11-10 14:37:43,348 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-10 14:37:43,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 1085 events. 51/1085 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5566 event pairs, 12 based on Foata normal form. 0/898 useless extension candidates. Maximal degree in co-relation 1084. Up to 39 conditions per place. [2024-11-10 14:37:43,374 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 14 selfloop transitions, 2 changer transitions 0/603 dead transitions. [2024-11-10 14:37:43,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 603 transitions, 1248 flow [2024-11-10 14:37:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:43,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2024-11-10 14:37:43,379 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9594247560349255 [2024-11-10 14:37:43,379 INFO L175 Difference]: Start difference. First operand has 591 places, 604 transitions, 1218 flow. Second operand 3 states and 1868 transitions. [2024-11-10 14:37:43,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 603 transitions, 1248 flow [2024-11-10 14:37:43,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 603 transitions, 1244 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:43,390 INFO L231 Difference]: Finished difference. Result has 590 places, 603 transitions, 1216 flow [2024-11-10 14:37:43,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1212, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1216, PETRI_PLACES=590, PETRI_TRANSITIONS=603} [2024-11-10 14:37:43,393 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -14 predicate places. [2024-11-10 14:37:43,394 INFO L471 AbstractCegarLoop]: Abstraction has has 590 places, 603 transitions, 1216 flow [2024-11-10 14:37:43,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 618.3333333333334) internal successors, (1855), 3 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:43,395 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:43,395 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:43,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:37:43,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:43,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:43,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1229305947, now seen corresponding path program 1 times [2024-11-10 14:37:43,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:43,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916424628] [2024-11-10 14:37:43,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:43,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:43,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:43,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:43,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916424628] [2024-11-10 14:37:43,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916424628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:43,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:43,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:43,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777796157] [2024-11-10 14:37:43,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:43,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:43,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:43,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:43,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:43,509 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 617 out of 649 [2024-11-10 14:37:43,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 603 transitions, 1216 flow. Second operand has 3 states, 3 states have (on average 618.3333333333334) internal successors, (1855), 3 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:43,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:43,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 617 of 649 [2024-11-10 14:37:43,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:43,812 INFO L124 PetriNetUnfolderBase]: 89/1780 cut-off events. [2024-11-10 14:37:43,813 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2024-11-10 14:37:43,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1850 conditions, 1780 events. 89/1780 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11618 event pairs, 20 based on Foata normal form. 0/1442 useless extension candidates. Maximal degree in co-relation 1789. Up to 51 conditions per place. [2024-11-10 14:37:43,845 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 14 selfloop transitions, 2 changer transitions 0/602 dead transitions. [2024-11-10 14:37:43,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 602 transitions, 1246 flow [2024-11-10 14:37:43,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:43,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2024-11-10 14:37:43,850 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9594247560349255 [2024-11-10 14:37:43,850 INFO L175 Difference]: Start difference. First operand has 590 places, 603 transitions, 1216 flow. Second operand 3 states and 1868 transitions. [2024-11-10 14:37:43,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 602 transitions, 1246 flow [2024-11-10 14:37:43,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 602 transitions, 1242 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:43,859 INFO L231 Difference]: Finished difference. Result has 589 places, 602 transitions, 1214 flow [2024-11-10 14:37:43,860 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1214, PETRI_PLACES=589, PETRI_TRANSITIONS=602} [2024-11-10 14:37:43,861 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -15 predicate places. [2024-11-10 14:37:43,863 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 602 transitions, 1214 flow [2024-11-10 14:37:43,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 618.3333333333334) internal successors, (1855), 3 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:43,864 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:43,864 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:43,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:37:43,865 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:43,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:43,866 INFO L85 PathProgramCache]: Analyzing trace with hash 480066450, now seen corresponding path program 1 times [2024-11-10 14:37:43,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:43,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547335048] [2024-11-10 14:37:43,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:43,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:43,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:43,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547335048] [2024-11-10 14:37:43,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547335048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:43,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:43,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:43,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614727983] [2024-11-10 14:37:43,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:43,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:43,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:43,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:43,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:43,972 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 617 out of 649 [2024-11-10 14:37:43,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 602 transitions, 1214 flow. Second operand has 3 states, 3 states have (on average 618.3333333333334) internal successors, (1855), 3 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:43,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:43,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 617 of 649 [2024-11-10 14:37:43,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:44,136 INFO L124 PetriNetUnfolderBase]: 49/861 cut-off events. [2024-11-10 14:37:44,136 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-10 14:37:44,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 861 events. 49/861 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3765 event pairs, 20 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 854. Up to 51 conditions per place. [2024-11-10 14:37:44,152 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 14 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2024-11-10 14:37:44,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 601 transitions, 1244 flow [2024-11-10 14:37:44,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2024-11-10 14:37:44,156 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9594247560349255 [2024-11-10 14:37:44,157 INFO L175 Difference]: Start difference. First operand has 589 places, 602 transitions, 1214 flow. Second operand 3 states and 1868 transitions. [2024-11-10 14:37:44,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 601 transitions, 1244 flow [2024-11-10 14:37:44,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 601 transitions, 1240 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:44,165 INFO L231 Difference]: Finished difference. Result has 588 places, 601 transitions, 1212 flow [2024-11-10 14:37:44,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=586, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1212, PETRI_PLACES=588, PETRI_TRANSITIONS=601} [2024-11-10 14:37:44,167 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -16 predicate places. [2024-11-10 14:37:44,167 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 601 transitions, 1212 flow [2024-11-10 14:37:44,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 618.3333333333334) internal successors, (1855), 3 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:44,169 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:44,169 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:44,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:37:44,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:44,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:44,170 INFO L85 PathProgramCache]: Analyzing trace with hash -818209674, now seen corresponding path program 1 times [2024-11-10 14:37:44,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:44,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338300141] [2024-11-10 14:37:44,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:44,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:44,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:44,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:44,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338300141] [2024-11-10 14:37:44,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338300141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:44,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:44,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:44,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862451744] [2024-11-10 14:37:44,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:44,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:44,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:44,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:44,245 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 649 [2024-11-10 14:37:44,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 601 transitions, 1212 flow. Second operand has 3 states, 3 states have (on average 614.0) internal successors, (1842), 3 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:44,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:44,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 649 [2024-11-10 14:37:44,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:44,534 INFO L124 PetriNetUnfolderBase]: 102/1566 cut-off events. [2024-11-10 14:37:44,534 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2024-11-10 14:37:44,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 1566 events. 102/1566 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9594 event pairs, 32 based on Foata normal form. 0/1301 useless extension candidates. Maximal degree in co-relation 1603. Up to 97 conditions per place. [2024-11-10 14:37:44,563 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 16 selfloop transitions, 1 changer transitions 0/596 dead transitions. [2024-11-10 14:37:44,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 596 transitions, 1236 flow [2024-11-10 14:37:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-11-10 14:37:44,567 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9558294812532101 [2024-11-10 14:37:44,567 INFO L175 Difference]: Start difference. First operand has 588 places, 601 transitions, 1212 flow. Second operand 3 states and 1861 transitions. [2024-11-10 14:37:44,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 596 transitions, 1236 flow [2024-11-10 14:37:44,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 596 transitions, 1232 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:44,575 INFO L231 Difference]: Finished difference. Result has 583 places, 596 transitions, 1200 flow [2024-11-10 14:37:44,576 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1200, PETRI_PLACES=583, PETRI_TRANSITIONS=596} [2024-11-10 14:37:44,577 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -21 predicate places. [2024-11-10 14:37:44,578 INFO L471 AbstractCegarLoop]: Abstraction has has 583 places, 596 transitions, 1200 flow [2024-11-10 14:37:44,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.0) internal successors, (1842), 3 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:44,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:44,579 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:44,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:37:44,579 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:44,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:44,580 INFO L85 PathProgramCache]: Analyzing trace with hash -168160631, now seen corresponding path program 1 times [2024-11-10 14:37:44,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:44,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255493759] [2024-11-10 14:37:44,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:44,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:45,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:45,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:45,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255493759] [2024-11-10 14:37:45,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255493759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:45,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:45,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:37:45,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763649913] [2024-11-10 14:37:45,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:45,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:37:45,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:45,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:37:45,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:37:45,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 649 [2024-11-10 14:37:45,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 583 places, 596 transitions, 1200 flow. Second operand has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:45,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:45,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 649 [2024-11-10 14:37:45,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:53,447 INFO L124 PetriNetUnfolderBase]: 12846/49142 cut-off events. [2024-11-10 14:37:53,448 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-11-10 14:37:53,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66623 conditions, 49142 events. 12846/49142 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1115. Compared 645971 event pairs, 10080 based on Foata normal form. 0/40953 useless extension candidates. Maximal degree in co-relation 66547. Up to 17156 conditions per place. [2024-11-10 14:37:53,918 INFO L140 encePairwiseOnDemand]: 631/649 looper letters, 78 selfloop transitions, 15 changer transitions 0/593 dead transitions. [2024-11-10 14:37:53,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 593 transitions, 1380 flow [2024-11-10 14:37:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:37:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:37:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3330 transitions. [2024-11-10 14:37:53,926 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8551617873651772 [2024-11-10 14:37:53,926 INFO L175 Difference]: Start difference. First operand has 583 places, 596 transitions, 1200 flow. Second operand 6 states and 3330 transitions. [2024-11-10 14:37:53,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 593 transitions, 1380 flow [2024-11-10 14:37:53,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 593 transitions, 1379 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:37:53,934 INFO L231 Difference]: Finished difference. Result has 584 places, 593 transitions, 1223 flow [2024-11-10 14:37:53,935 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1193, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1223, PETRI_PLACES=584, PETRI_TRANSITIONS=593} [2024-11-10 14:37:53,938 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -20 predicate places. [2024-11-10 14:37:53,939 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 593 transitions, 1223 flow [2024-11-10 14:37:53,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 540.5) internal successors, (3243), 6 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:53,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:53,941 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:53,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:37:53,942 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:53,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:53,946 INFO L85 PathProgramCache]: Analyzing trace with hash 2068406794, now seen corresponding path program 1 times [2024-11-10 14:37:53,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:53,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802450551] [2024-11-10 14:37:53,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:53,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:53,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:53,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802450551] [2024-11-10 14:37:53,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802450551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:53,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:53,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:53,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740828939] [2024-11-10 14:37:53,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:53,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:54,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:54,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:54,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:54,025 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 649 [2024-11-10 14:37:54,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 593 transitions, 1223 flow. Second operand has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:54,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:54,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 649 [2024-11-10 14:37:54,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:54,344 INFO L124 PetriNetUnfolderBase]: 51/1070 cut-off events. [2024-11-10 14:37:54,345 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-10 14:37:54,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 1070 events. 51/1070 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 5105 event pairs, 12 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1087. Up to 38 conditions per place. [2024-11-10 14:37:54,360 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/592 dead transitions. [2024-11-10 14:37:54,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 592 transitions, 1251 flow [2024-11-10 14:37:54,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:54,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:54,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-11-10 14:37:54,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96045197740113 [2024-11-10 14:37:54,365 INFO L175 Difference]: Start difference. First operand has 584 places, 593 transitions, 1223 flow. Second operand 3 states and 1870 transitions. [2024-11-10 14:37:54,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 592 transitions, 1251 flow [2024-11-10 14:37:54,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 592 transitions, 1221 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:37:54,376 INFO L231 Difference]: Finished difference. Result has 580 places, 592 transitions, 1195 flow [2024-11-10 14:37:54,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=590, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1195, PETRI_PLACES=580, PETRI_TRANSITIONS=592} [2024-11-10 14:37:54,378 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -24 predicate places. [2024-11-10 14:37:54,378 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 592 transitions, 1195 flow [2024-11-10 14:37:54,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:54,379 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:54,380 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:54,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:37:54,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:54,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:54,382 INFO L85 PathProgramCache]: Analyzing trace with hash 371533793, now seen corresponding path program 1 times [2024-11-10 14:37:54,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:54,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218773215] [2024-11-10 14:37:54,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:54,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:54,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:54,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:54,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218773215] [2024-11-10 14:37:54,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218773215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:54,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:54,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:54,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604012565] [2024-11-10 14:37:54,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:54,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:54,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:54,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:54,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:54,457 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 649 [2024-11-10 14:37:54,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 592 transitions, 1195 flow. Second operand has 3 states, 3 states have (on average 614.0) internal successors, (1842), 3 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:54,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:54,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 649 [2024-11-10 14:37:54,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:54,959 INFO L124 PetriNetUnfolderBase]: 184/2393 cut-off events. [2024-11-10 14:37:54,960 INFO L125 PetriNetUnfolderBase]: For 14/18 co-relation queries the response was YES. [2024-11-10 14:37:54,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2595 conditions, 2393 events. 184/2393 cut-off events. For 14/18 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 18800 event pairs, 64 based on Foata normal form. 0/1978 useless extension candidates. Maximal degree in co-relation 2518. Up to 164 conditions per place. [2024-11-10 14:37:55,006 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 16 selfloop transitions, 1 changer transitions 0/587 dead transitions. [2024-11-10 14:37:55,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 587 transitions, 1219 flow [2024-11-10 14:37:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:55,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-11-10 14:37:55,011 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9558294812532101 [2024-11-10 14:37:55,011 INFO L175 Difference]: Start difference. First operand has 580 places, 592 transitions, 1195 flow. Second operand 3 states and 1861 transitions. [2024-11-10 14:37:55,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 587 transitions, 1219 flow [2024-11-10 14:37:55,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 587 transitions, 1215 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:55,021 INFO L231 Difference]: Finished difference. Result has 575 places, 587 transitions, 1183 flow [2024-11-10 14:37:55,022 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1183, PETRI_PLACES=575, PETRI_TRANSITIONS=587} [2024-11-10 14:37:55,023 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -29 predicate places. [2024-11-10 14:37:55,023 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 587 transitions, 1183 flow [2024-11-10 14:37:55,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.0) internal successors, (1842), 3 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:55,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:55,025 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:55,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:37:55,025 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:55,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:55,026 INFO L85 PathProgramCache]: Analyzing trace with hash 739503324, now seen corresponding path program 1 times [2024-11-10 14:37:55,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:55,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544075810] [2024-11-10 14:37:55,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:55,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:55,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:55,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:55,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544075810] [2024-11-10 14:37:55,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544075810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:55,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:55,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:55,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072573934] [2024-11-10 14:37:55,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:55,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:55,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:55,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:55,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:55,102 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 649 [2024-11-10 14:37:55,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 587 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:55,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:55,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 649 [2024-11-10 14:37:55,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:55,411 INFO L124 PetriNetUnfolderBase]: 89/1744 cut-off events. [2024-11-10 14:37:55,411 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-10 14:37:55,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1813 conditions, 1744 events. 89/1744 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 9987 event pairs, 20 based on Foata normal form. 0/1441 useless extension candidates. Maximal degree in co-relation 1736. Up to 50 conditions per place. [2024-11-10 14:37:55,428 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/586 dead transitions. [2024-11-10 14:37:55,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 586 transitions, 1211 flow [2024-11-10 14:37:55,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:55,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-11-10 14:37:55,433 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96045197740113 [2024-11-10 14:37:55,434 INFO L175 Difference]: Start difference. First operand has 575 places, 587 transitions, 1183 flow. Second operand 3 states and 1870 transitions. [2024-11-10 14:37:55,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 586 transitions, 1211 flow [2024-11-10 14:37:55,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 586 transitions, 1210 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:37:55,442 INFO L231 Difference]: Finished difference. Result has 575 places, 586 transitions, 1184 flow [2024-11-10 14:37:55,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1184, PETRI_PLACES=575, PETRI_TRANSITIONS=586} [2024-11-10 14:37:55,444 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -29 predicate places. [2024-11-10 14:37:55,444 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 586 transitions, 1184 flow [2024-11-10 14:37:55,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:55,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:55,446 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:55,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:37:55,446 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:55,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:55,447 INFO L85 PathProgramCache]: Analyzing trace with hash -158451840, now seen corresponding path program 1 times [2024-11-10 14:37:55,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:55,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669439286] [2024-11-10 14:37:55,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:55,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:55,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:55,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669439286] [2024-11-10 14:37:55,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669439286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:55,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:55,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:55,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283328885] [2024-11-10 14:37:55,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:55,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:55,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:55,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:55,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:55,510 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 649 [2024-11-10 14:37:55,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 586 transitions, 1184 flow. Second operand has 3 states, 3 states have (on average 614.0) internal successors, (1842), 3 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:55,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:55,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 649 [2024-11-10 14:37:55,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:55,826 INFO L124 PetriNetUnfolderBase]: 167/1869 cut-off events. [2024-11-10 14:37:55,827 INFO L125 PetriNetUnfolderBase]: For 33/35 co-relation queries the response was YES. [2024-11-10 14:37:55,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 1869 events. 167/1869 cut-off events. For 33/35 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 12357 event pairs, 64 based on Foata normal form. 0/1583 useless extension candidates. Maximal degree in co-relation 1976. Up to 169 conditions per place. [2024-11-10 14:37:55,871 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 16 selfloop transitions, 1 changer transitions 0/581 dead transitions. [2024-11-10 14:37:55,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 581 transitions, 1208 flow [2024-11-10 14:37:55,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:55,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-11-10 14:37:55,876 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9558294812532101 [2024-11-10 14:37:55,876 INFO L175 Difference]: Start difference. First operand has 575 places, 586 transitions, 1184 flow. Second operand 3 states and 1861 transitions. [2024-11-10 14:37:55,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 581 transitions, 1208 flow [2024-11-10 14:37:55,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 581 transitions, 1204 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:55,886 INFO L231 Difference]: Finished difference. Result has 570 places, 581 transitions, 1172 flow [2024-11-10 14:37:55,887 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1172, PETRI_PLACES=570, PETRI_TRANSITIONS=581} [2024-11-10 14:37:55,888 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -34 predicate places. [2024-11-10 14:37:55,888 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 581 transitions, 1172 flow [2024-11-10 14:37:55,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 614.0) internal successors, (1842), 3 states have internal predecessors, (1842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:55,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:55,890 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:55,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:37:55,891 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:55,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:55,891 INFO L85 PathProgramCache]: Analyzing trace with hash -380498497, now seen corresponding path program 1 times [2024-11-10 14:37:55,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:55,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305897293] [2024-11-10 14:37:55,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:55,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:55,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:55,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:55,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305897293] [2024-11-10 14:37:55,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305897293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:55,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:55,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:55,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292703197] [2024-11-10 14:37:55,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:55,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:55,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:55,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:55,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:55,968 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 649 [2024-11-10 14:37:55,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 581 transitions, 1172 flow. Second operand has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:55,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:55,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 649 [2024-11-10 14:37:55,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:56,102 INFO L124 PetriNetUnfolderBase]: 49/832 cut-off events. [2024-11-10 14:37:56,103 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-10 14:37:56,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 894 conditions, 832 events. 49/832 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3183 event pairs, 20 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 817. Up to 50 conditions per place. [2024-11-10 14:37:56,120 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2024-11-10 14:37:56,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 580 transitions, 1200 flow [2024-11-10 14:37:56,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-11-10 14:37:56,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96045197740113 [2024-11-10 14:37:56,125 INFO L175 Difference]: Start difference. First operand has 570 places, 581 transitions, 1172 flow. Second operand 3 states and 1870 transitions. [2024-11-10 14:37:56,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 580 transitions, 1200 flow [2024-11-10 14:37:56,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 580 transitions, 1199 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:37:56,133 INFO L231 Difference]: Finished difference. Result has 570 places, 580 transitions, 1173 flow [2024-11-10 14:37:56,134 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1169, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1173, PETRI_PLACES=570, PETRI_TRANSITIONS=580} [2024-11-10 14:37:56,135 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -34 predicate places. [2024-11-10 14:37:56,135 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 580 transitions, 1173 flow [2024-11-10 14:37:56,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.3333333333334) internal successors, (1858), 3 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:56,137 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:56,137 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:56,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:37:56,137 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:56,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2086964785, now seen corresponding path program 1 times [2024-11-10 14:37:56,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:56,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733151776] [2024-11-10 14:37:56,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:56,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:56,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:56,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733151776] [2024-11-10 14:37:56,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733151776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:56,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:56,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:56,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36837729] [2024-11-10 14:37:56,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:56,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:56,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:56,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:56,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:56,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 649 [2024-11-10 14:37:56,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 580 transitions, 1173 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:56,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:56,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 649 [2024-11-10 14:37:56,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:56,530 INFO L124 PetriNetUnfolderBase]: 96/1557 cut-off events. [2024-11-10 14:37:56,530 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-10 14:37:56,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 1557 events. 96/1557 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9873 event pairs, 26 based on Foata normal form. 0/1323 useless extension candidates. Maximal degree in co-relation 1578. Up to 75 conditions per place. [2024-11-10 14:37:56,557 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 17 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2024-11-10 14:37:56,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 580 transitions, 1213 flow [2024-11-10 14:37:56,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1871 transitions. [2024-11-10 14:37:56,562 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9609655880842322 [2024-11-10 14:37:56,562 INFO L175 Difference]: Start difference. First operand has 570 places, 580 transitions, 1173 flow. Second operand 3 states and 1871 transitions. [2024-11-10 14:37:56,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 580 transitions, 1213 flow [2024-11-10 14:37:56,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 580 transitions, 1209 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:56,575 INFO L231 Difference]: Finished difference. Result has 567 places, 578 transitions, 1175 flow [2024-11-10 14:37:56,576 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1161, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1175, PETRI_PLACES=567, PETRI_TRANSITIONS=578} [2024-11-10 14:37:56,576 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -37 predicate places. [2024-11-10 14:37:56,577 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 578 transitions, 1175 flow [2024-11-10 14:37:56,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:56,578 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:56,578 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:56,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:37:56,579 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:56,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:56,579 INFO L85 PathProgramCache]: Analyzing trace with hash -176528174, now seen corresponding path program 1 times [2024-11-10 14:37:56,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:56,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232590213] [2024-11-10 14:37:56,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:56,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:56,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:56,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232590213] [2024-11-10 14:37:56,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232590213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:56,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:56,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:56,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67557259] [2024-11-10 14:37:56,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:56,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:56,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:56,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:56,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:56,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 649 [2024-11-10 14:37:56,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 578 transitions, 1175 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:56,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:56,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 649 [2024-11-10 14:37:56,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:57,106 INFO L124 PetriNetUnfolderBase]: 160/2298 cut-off events. [2024-11-10 14:37:57,107 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:37:57,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 2298 events. 160/2298 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 17829 event pairs, 53 based on Foata normal form. 0/1950 useless extension candidates. Maximal degree in co-relation 2398. Up to 123 conditions per place. [2024-11-10 14:37:57,148 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 17 selfloop transitions, 2 changer transitions 0/578 dead transitions. [2024-11-10 14:37:57,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 578 transitions, 1215 flow [2024-11-10 14:37:57,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:57,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1871 transitions. [2024-11-10 14:37:57,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9609655880842322 [2024-11-10 14:37:57,153 INFO L175 Difference]: Start difference. First operand has 567 places, 578 transitions, 1175 flow. Second operand 3 states and 1871 transitions. [2024-11-10 14:37:57,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 578 transitions, 1215 flow [2024-11-10 14:37:57,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 578 transitions, 1215 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:37:57,163 INFO L231 Difference]: Finished difference. Result has 566 places, 576 transitions, 1181 flow [2024-11-10 14:37:57,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1181, PETRI_PLACES=566, PETRI_TRANSITIONS=576} [2024-11-10 14:37:57,167 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -38 predicate places. [2024-11-10 14:37:57,167 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 576 transitions, 1181 flow [2024-11-10 14:37:57,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:57,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:57,169 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:57,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:37:57,169 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:57,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:57,169 INFO L85 PathProgramCache]: Analyzing trace with hash -659668940, now seen corresponding path program 1 times [2024-11-10 14:37:57,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:57,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374373470] [2024-11-10 14:37:57,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:57,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:57,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:57,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374373470] [2024-11-10 14:37:57,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374373470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:57,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:57,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:57,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367265315] [2024-11-10 14:37:57,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:57,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:57,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:57,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:57,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:57,261 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 649 [2024-11-10 14:37:57,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 576 transitions, 1181 flow. Second operand has 3 states, 3 states have (on average 617.6666666666666) internal successors, (1853), 3 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:57,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:57,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 649 [2024-11-10 14:37:57,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:57,923 INFO L124 PetriNetUnfolderBase]: 251/3262 cut-off events. [2024-11-10 14:37:57,924 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2024-11-10 14:37:57,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3499 conditions, 3262 events. 251/3262 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 28595 event pairs, 52 based on Foata normal form. 1/2778 useless extension candidates. Maximal degree in co-relation 3421. Up to 202 conditions per place. [2024-11-10 14:37:57,964 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 17 selfloop transitions, 2 changer transitions 0/576 dead transitions. [2024-11-10 14:37:57,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 576 transitions, 1221 flow [2024-11-10 14:37:57,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1871 transitions. [2024-11-10 14:37:57,969 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9609655880842322 [2024-11-10 14:37:57,969 INFO L175 Difference]: Start difference. First operand has 566 places, 576 transitions, 1181 flow. Second operand 3 states and 1871 transitions. [2024-11-10 14:37:57,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 576 transitions, 1221 flow [2024-11-10 14:37:57,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 576 transitions, 1221 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:37:57,981 INFO L231 Difference]: Finished difference. Result has 565 places, 574 transitions, 1187 flow [2024-11-10 14:37:57,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1173, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1187, PETRI_PLACES=565, PETRI_TRANSITIONS=574} [2024-11-10 14:37:57,982 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -39 predicate places. [2024-11-10 14:37:57,982 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 574 transitions, 1187 flow [2024-11-10 14:37:57,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.6666666666666) internal successors, (1853), 3 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:57,987 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:57,987 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:57,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:37:57,988 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:57,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:57,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1601769188, now seen corresponding path program 1 times [2024-11-10 14:37:57,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:57,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950364481] [2024-11-10 14:37:57,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:57,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:58,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:58,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950364481] [2024-11-10 14:37:58,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950364481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:58,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:58,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:58,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060250725] [2024-11-10 14:37:58,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:58,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:58,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:58,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:58,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:58,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-10 14:37:58,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 574 transitions, 1187 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:58,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:58,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-10 14:37:58,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:58,534 INFO L124 PetriNetUnfolderBase]: 109/2052 cut-off events. [2024-11-10 14:37:58,534 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2024-11-10 14:37:58,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2162 conditions, 2052 events. 109/2052 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 13378 event pairs, 8 based on Foata normal form. 1/1767 useless extension candidates. Maximal degree in co-relation 2084. Up to 33 conditions per place. [2024-11-10 14:37:58,562 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2024-11-10 14:37:58,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 575 transitions, 1221 flow [2024-11-10 14:37:58,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:58,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1879 transitions. [2024-11-10 14:37:58,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650744735490498 [2024-11-10 14:37:58,566 INFO L175 Difference]: Start difference. First operand has 565 places, 574 transitions, 1187 flow. Second operand 3 states and 1879 transitions. [2024-11-10 14:37:58,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 575 transitions, 1221 flow [2024-11-10 14:37:58,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 575 transitions, 1221 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:37:58,577 INFO L231 Difference]: Finished difference. Result has 566 places, 573 transitions, 1189 flow [2024-11-10 14:37:58,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1189, PETRI_PLACES=566, PETRI_TRANSITIONS=573} [2024-11-10 14:37:58,578 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -38 predicate places. [2024-11-10 14:37:58,578 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 573 transitions, 1189 flow [2024-11-10 14:37:58,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:58,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:58,580 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:58,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:37:58,580 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:58,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:58,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1946788395, now seen corresponding path program 1 times [2024-11-10 14:37:58,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:58,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718577246] [2024-11-10 14:37:58,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:58,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:58,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:58,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718577246] [2024-11-10 14:37:58,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718577246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:58,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:58,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:37:58,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916430773] [2024-11-10 14:37:58,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:58,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:58,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:58,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:58,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:58,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-10 14:37:58,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 573 transitions, 1189 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:58,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:58,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-10 14:37:58,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:58,935 INFO L124 PetriNetUnfolderBase]: 90/1584 cut-off events. [2024-11-10 14:37:58,935 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-10 14:37:58,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1700 conditions, 1584 events. 90/1584 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 10263 event pairs, 12 based on Foata normal form. 0/1368 useless extension candidates. Maximal degree in co-relation 1667. Up to 40 conditions per place. [2024-11-10 14:37:58,957 INFO L140 encePairwiseOnDemand]: 645/649 looper letters, 14 selfloop transitions, 3 changer transitions 0/576 dead transitions. [2024-11-10 14:37:58,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 576 transitions, 1231 flow [2024-11-10 14:37:58,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:58,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1881 transitions. [2024-11-10 14:37:58,960 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9661016949152542 [2024-11-10 14:37:58,960 INFO L175 Difference]: Start difference. First operand has 566 places, 573 transitions, 1189 flow. Second operand 3 states and 1881 transitions. [2024-11-10 14:37:58,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 576 transitions, 1231 flow [2024-11-10 14:37:58,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 576 transitions, 1227 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:58,970 INFO L231 Difference]: Finished difference. Result has 568 places, 574 transitions, 1203 flow [2024-11-10 14:37:58,971 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1203, PETRI_PLACES=568, PETRI_TRANSITIONS=574} [2024-11-10 14:37:58,972 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -36 predicate places. [2024-11-10 14:37:58,972 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 574 transitions, 1203 flow [2024-11-10 14:37:58,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:58,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:58,973 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:58,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:37:58,973 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:58,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:58,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1774160570, now seen corresponding path program 1 times [2024-11-10 14:37:58,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:58,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567798183] [2024-11-10 14:37:58,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:58,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:59,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:59,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:59,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567798183] [2024-11-10 14:37:59,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567798183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:59,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:59,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:59,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555100067] [2024-11-10 14:37:59,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:59,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:59,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:59,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:59,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:59,057 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 649 [2024-11-10 14:37:59,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 574 transitions, 1203 flow. Second operand has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:59,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:59,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 649 [2024-11-10 14:37:59,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:59,581 INFO L124 PetriNetUnfolderBase]: 198/2671 cut-off events. [2024-11-10 14:37:59,581 INFO L125 PetriNetUnfolderBase]: For 41/43 co-relation queries the response was YES. [2024-11-10 14:37:59,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2949 conditions, 2671 events. 198/2671 cut-off events. For 41/43 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 20061 event pairs, 24 based on Foata normal form. 0/2314 useless extension candidates. Maximal degree in co-relation 2869. Up to 176 conditions per place. [2024-11-10 14:37:59,628 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 20 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2024-11-10 14:37:59,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 577 transitions, 1258 flow [2024-11-10 14:37:59,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1874 transitions. [2024-11-10 14:37:59,631 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9625064201335388 [2024-11-10 14:37:59,631 INFO L175 Difference]: Start difference. First operand has 568 places, 574 transitions, 1203 flow. Second operand 3 states and 1874 transitions. [2024-11-10 14:37:59,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 577 transitions, 1258 flow [2024-11-10 14:37:59,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 577 transitions, 1252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:59,641 INFO L231 Difference]: Finished difference. Result has 565 places, 572 transitions, 1203 flow [2024-11-10 14:37:59,641 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=562, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1203, PETRI_PLACES=565, PETRI_TRANSITIONS=572} [2024-11-10 14:37:59,642 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -39 predicate places. [2024-11-10 14:37:59,642 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 572 transitions, 1203 flow [2024-11-10 14:37:59,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.3333333333334) internal successors, (1852), 3 states have internal predecessors, (1852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:59,643 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:59,643 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:59,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:37:59,643 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:37:59,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:59,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1813105643, now seen corresponding path program 1 times [2024-11-10 14:37:59,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:59,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550135291] [2024-11-10 14:37:59,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:59,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:59,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:59,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:59,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550135291] [2024-11-10 14:37:59,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550135291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:59,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:59,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:59,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678167903] [2024-11-10 14:37:59,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:59,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:59,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:59,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:59,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:59,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-10 14:37:59,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 572 transitions, 1203 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:37:59,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:59,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-10 14:37:59,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:00,245 INFO L124 PetriNetUnfolderBase]: 184/2916 cut-off events. [2024-11-10 14:38:00,245 INFO L125 PetriNetUnfolderBase]: For 18/69 co-relation queries the response was YES. [2024-11-10 14:38:00,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3139 conditions, 2916 events. 184/2916 cut-off events. For 18/69 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 22376 event pairs, 16 based on Foata normal form. 2/2536 useless extension candidates. Maximal degree in co-relation 3059. Up to 80 conditions per place. [2024-11-10 14:38:00,290 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2024-11-10 14:38:00,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 573 transitions, 1237 flow [2024-11-10 14:38:00,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:00,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1879 transitions. [2024-11-10 14:38:00,294 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650744735490498 [2024-11-10 14:38:00,294 INFO L175 Difference]: Start difference. First operand has 565 places, 572 transitions, 1203 flow. Second operand 3 states and 1879 transitions. [2024-11-10 14:38:00,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 573 transitions, 1237 flow [2024-11-10 14:38:00,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 573 transitions, 1237 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:38:00,304 INFO L231 Difference]: Finished difference. Result has 566 places, 571 transitions, 1205 flow [2024-11-10 14:38:00,304 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1205, PETRI_PLACES=566, PETRI_TRANSITIONS=571} [2024-11-10 14:38:00,305 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -38 predicate places. [2024-11-10 14:38:00,305 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 571 transitions, 1205 flow [2024-11-10 14:38:00,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:00,306 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:00,306 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:00,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 14:38:00,307 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:00,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:00,307 INFO L85 PathProgramCache]: Analyzing trace with hash 433725869, now seen corresponding path program 1 times [2024-11-10 14:38:00,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:00,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648115157] [2024-11-10 14:38:00,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:00,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:00,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:00,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:00,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648115157] [2024-11-10 14:38:00,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648115157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:00,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:00,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:38:00,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665954271] [2024-11-10 14:38:00,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:00,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:00,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:00,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:00,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:00,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-10 14:38:00,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 571 transitions, 1205 flow. Second operand has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:00,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:00,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-10 14:38:00,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:00,787 INFO L124 PetriNetUnfolderBase]: 154/2286 cut-off events. [2024-11-10 14:38:00,788 INFO L125 PetriNetUnfolderBase]: For 21/54 co-relation queries the response was YES. [2024-11-10 14:38:00,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2506 conditions, 2286 events. 154/2286 cut-off events. For 21/54 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 17160 event pairs, 24 based on Foata normal form. 0/1982 useless extension candidates. Maximal degree in co-relation 2444. Up to 78 conditions per place. [2024-11-10 14:38:00,827 INFO L140 encePairwiseOnDemand]: 645/649 looper letters, 14 selfloop transitions, 3 changer transitions 0/574 dead transitions. [2024-11-10 14:38:00,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 574 transitions, 1247 flow [2024-11-10 14:38:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1881 transitions. [2024-11-10 14:38:00,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9661016949152542 [2024-11-10 14:38:00,831 INFO L175 Difference]: Start difference. First operand has 566 places, 571 transitions, 1205 flow. Second operand 3 states and 1881 transitions. [2024-11-10 14:38:00,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 574 transitions, 1247 flow [2024-11-10 14:38:00,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 574 transitions, 1243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:00,842 INFO L231 Difference]: Finished difference. Result has 568 places, 572 transitions, 1219 flow [2024-11-10 14:38:00,843 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1219, PETRI_PLACES=568, PETRI_TRANSITIONS=572} [2024-11-10 14:38:00,843 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -36 predicate places. [2024-11-10 14:38:00,843 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 572 transitions, 1219 flow [2024-11-10 14:38:00,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:00,844 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:00,844 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:00,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 14:38:00,845 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:00,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash 112171384, now seen corresponding path program 1 times [2024-11-10 14:38:00,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:00,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200368235] [2024-11-10 14:38:00,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:00,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:00,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:00,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200368235] [2024-11-10 14:38:00,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200368235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:00,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:00,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:00,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897170370] [2024-11-10 14:38:00,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:00,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:00,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:00,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:00,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:00,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-10 14:38:00,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 572 transitions, 1219 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:00,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:00,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-10 14:38:00,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:01,397 INFO L124 PetriNetUnfolderBase]: 162/2665 cut-off events. [2024-11-10 14:38:01,397 INFO L125 PetriNetUnfolderBase]: For 18/24 co-relation queries the response was YES. [2024-11-10 14:38:01,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2917 conditions, 2665 events. 162/2665 cut-off events. For 18/24 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 19694 event pairs, 10 based on Foata normal form. 0/2331 useless extension candidates. Maximal degree in co-relation 2835. Up to 57 conditions per place. [2024-11-10 14:38:01,437 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2024-11-10 14:38:01,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 573 transitions, 1253 flow [2024-11-10 14:38:01,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:01,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:01,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1879 transitions. [2024-11-10 14:38:01,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650744735490498 [2024-11-10 14:38:01,441 INFO L175 Difference]: Start difference. First operand has 568 places, 572 transitions, 1219 flow. Second operand 3 states and 1879 transitions. [2024-11-10 14:38:01,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 573 transitions, 1253 flow [2024-11-10 14:38:01,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 573 transitions, 1247 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:01,453 INFO L231 Difference]: Finished difference. Result has 567 places, 571 transitions, 1215 flow [2024-11-10 14:38:01,453 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1215, PETRI_PLACES=567, PETRI_TRANSITIONS=571} [2024-11-10 14:38:01,454 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -37 predicate places. [2024-11-10 14:38:01,454 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 571 transitions, 1215 flow [2024-11-10 14:38:01,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:01,455 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:01,455 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:01,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 14:38:01,455 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:01,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:01,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1405760692, now seen corresponding path program 1 times [2024-11-10 14:38:01,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:01,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736658820] [2024-11-10 14:38:01,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:01,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:01,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:01,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:01,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736658820] [2024-11-10 14:38:01,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736658820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:01,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:01,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:38:01,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966638628] [2024-11-10 14:38:01,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:01,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:38:01,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:01,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:38:01,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:38:02,219 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 649 [2024-11-10 14:38:02,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 571 transitions, 1215 flow. Second operand has 8 states, 8 states have (on average 593.125) internal successors, (4745), 8 states have internal predecessors, (4745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:02,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:02,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 649 [2024-11-10 14:38:02,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:03,064 INFO L124 PetriNetUnfolderBase]: 253/3853 cut-off events. [2024-11-10 14:38:03,064 INFO L125 PetriNetUnfolderBase]: For 10/23 co-relation queries the response was YES. [2024-11-10 14:38:03,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4370 conditions, 3853 events. 253/3853 cut-off events. For 10/23 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 33514 event pairs, 42 based on Foata normal form. 5/3389 useless extension candidates. Maximal degree in co-relation 4316. Up to 146 conditions per place. [2024-11-10 14:38:03,125 INFO L140 encePairwiseOnDemand]: 634/649 looper letters, 70 selfloop transitions, 16 changer transitions 0/610 dead transitions. [2024-11-10 14:38:03,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 610 transitions, 1481 flow [2024-11-10 14:38:03,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 14:38:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 14:38:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6565 transitions. [2024-11-10 14:38:03,134 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9195965821543634 [2024-11-10 14:38:03,134 INFO L175 Difference]: Start difference. First operand has 567 places, 571 transitions, 1215 flow. Second operand 11 states and 6565 transitions. [2024-11-10 14:38:03,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 610 transitions, 1481 flow [2024-11-10 14:38:03,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 610 transitions, 1477 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:03,143 INFO L231 Difference]: Finished difference. Result has 580 places, 580 transitions, 1295 flow [2024-11-10 14:38:03,144 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1295, PETRI_PLACES=580, PETRI_TRANSITIONS=580} [2024-11-10 14:38:03,144 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -24 predicate places. [2024-11-10 14:38:03,145 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 580 transitions, 1295 flow [2024-11-10 14:38:03,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 593.125) internal successors, (4745), 8 states have internal predecessors, (4745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:03,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:03,146 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:03,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 14:38:03,147 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:03,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:03,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1737988907, now seen corresponding path program 1 times [2024-11-10 14:38:03,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:03,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438730375] [2024-11-10 14:38:03,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:03,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:03,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:03,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438730375] [2024-11-10 14:38:03,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438730375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:03,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:03,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:03,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341810454] [2024-11-10 14:38:03,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:03,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:03,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:03,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:03,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:03,225 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 649 [2024-11-10 14:38:03,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 580 transitions, 1295 flow. Second operand has 3 states, 3 states have (on average 617.6666666666666) internal successors, (1853), 3 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:03,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:03,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 649 [2024-11-10 14:38:03,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:04,384 INFO L124 PetriNetUnfolderBase]: 369/4906 cut-off events. [2024-11-10 14:38:04,385 INFO L125 PetriNetUnfolderBase]: For 37/67 co-relation queries the response was YES. [2024-11-10 14:38:04,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5635 conditions, 4906 events. 369/4906 cut-off events. For 37/67 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 42836 event pairs, 42 based on Foata normal form. 2/4324 useless extension candidates. Maximal degree in co-relation 5545. Up to 280 conditions per place. [2024-11-10 14:38:04,480 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 20 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2024-11-10 14:38:04,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 583 transitions, 1350 flow [2024-11-10 14:38:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:04,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1874 transitions. [2024-11-10 14:38:04,483 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9625064201335388 [2024-11-10 14:38:04,483 INFO L175 Difference]: Start difference. First operand has 580 places, 580 transitions, 1295 flow. Second operand 3 states and 1874 transitions. [2024-11-10 14:38:04,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 583 transitions, 1350 flow [2024-11-10 14:38:04,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 583 transitions, 1346 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:38:04,496 INFO L231 Difference]: Finished difference. Result has 578 places, 578 transitions, 1297 flow [2024-11-10 14:38:04,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=575, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1297, PETRI_PLACES=578, PETRI_TRANSITIONS=578} [2024-11-10 14:38:04,497 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -26 predicate places. [2024-11-10 14:38:04,497 INFO L471 AbstractCegarLoop]: Abstraction has has 578 places, 578 transitions, 1297 flow [2024-11-10 14:38:04,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.6666666666666) internal successors, (1853), 3 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:04,498 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:04,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:04,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 14:38:04,499 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:04,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:04,499 INFO L85 PathProgramCache]: Analyzing trace with hash -206042402, now seen corresponding path program 1 times [2024-11-10 14:38:04,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:04,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448391336] [2024-11-10 14:38:04,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:04,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:04,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:04,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:04,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448391336] [2024-11-10 14:38:04,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448391336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:04,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:04,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:04,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074832929] [2024-11-10 14:38:04,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:04,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:04,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:04,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:04,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:04,582 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-10 14:38:04,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 578 transitions, 1297 flow. Second operand has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:04,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:04,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-10 14:38:04,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:05,317 INFO L124 PetriNetUnfolderBase]: 263/3050 cut-off events. [2024-11-10 14:38:05,317 INFO L125 PetriNetUnfolderBase]: For 91/140 co-relation queries the response was YES. [2024-11-10 14:38:05,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3610 conditions, 3050 events. 263/3050 cut-off events. For 91/140 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 24936 event pairs, 54 based on Foata normal form. 0/2679 useless extension candidates. Maximal degree in co-relation 3521. Up to 213 conditions per place. [2024-11-10 14:38:05,377 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/579 dead transitions. [2024-11-10 14:38:05,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 579 transitions, 1331 flow [2024-11-10 14:38:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:05,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1879 transitions. [2024-11-10 14:38:05,382 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650744735490498 [2024-11-10 14:38:05,382 INFO L175 Difference]: Start difference. First operand has 578 places, 578 transitions, 1297 flow. Second operand 3 states and 1879 transitions. [2024-11-10 14:38:05,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 579 transitions, 1331 flow [2024-11-10 14:38:05,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 579 transitions, 1331 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:38:05,392 INFO L231 Difference]: Finished difference. Result has 579 places, 577 transitions, 1299 flow [2024-11-10 14:38:05,393 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1295, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1299, PETRI_PLACES=579, PETRI_TRANSITIONS=577} [2024-11-10 14:38:05,393 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -25 predicate places. [2024-11-10 14:38:05,393 INFO L471 AbstractCegarLoop]: Abstraction has has 579 places, 577 transitions, 1299 flow [2024-11-10 14:38:05,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:05,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:05,394 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:05,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 14:38:05,394 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:05,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:05,395 INFO L85 PathProgramCache]: Analyzing trace with hash 362250106, now seen corresponding path program 1 times [2024-11-10 14:38:05,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:05,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14492490] [2024-11-10 14:38:05,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:05,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:05,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:05,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14492490] [2024-11-10 14:38:05,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14492490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:05,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:05,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:05,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320887839] [2024-11-10 14:38:05,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:05,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:05,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:05,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:05,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:05,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-10 14:38:05,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 577 transitions, 1299 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:05,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:05,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-10 14:38:05,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:06,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1566] L90-20-->L90-19: Formula: (= |v_#race~get1~0_12| 0) InVars {} OutVars{#race~get1~0=|v_#race~get1~0_12|} AuxVars[] AssignedVars[#race~get1~0][463], [407#L77-2true, 661#(= |#race~n2~0| 0), 733#(= |#race~get2~0| 0), 353#L122-1true, 735#true, 593#L50-19true, Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 693#(= |#race~get1~0| 0), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 731#true, 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, 738#true, Black: 675#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), 681#(= |#race~count3~0| 0), 667#(= |#race~n3~0| 0), 677#(= |#race~count2~0| 0), Black: 691#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), 293#L90-19true]) [2024-11-10 14:38:06,300 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-10 14:38:06,300 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-10 14:38:06,300 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-11-10 14:38:06,300 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-10 14:38:06,450 INFO L124 PetriNetUnfolderBase]: 442/6413 cut-off events. [2024-11-10 14:38:06,450 INFO L125 PetriNetUnfolderBase]: For 58/116 co-relation queries the response was YES. [2024-11-10 14:38:06,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7209 conditions, 6413 events. 442/6413 cut-off events. For 58/116 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 62318 event pairs, 36 based on Foata normal form. 0/5634 useless extension candidates. Maximal degree in co-relation 7119. Up to 170 conditions per place. [2024-11-10 14:38:06,571 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/578 dead transitions. [2024-11-10 14:38:06,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 578 transitions, 1333 flow [2024-11-10 14:38:06,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:06,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:06,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1879 transitions. [2024-11-10 14:38:06,576 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650744735490498 [2024-11-10 14:38:06,576 INFO L175 Difference]: Start difference. First operand has 579 places, 577 transitions, 1299 flow. Second operand 3 states and 1879 transitions. [2024-11-10 14:38:06,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 578 transitions, 1333 flow [2024-11-10 14:38:06,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 578 transitions, 1329 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:06,591 INFO L231 Difference]: Finished difference. Result has 578 places, 576 transitions, 1297 flow [2024-11-10 14:38:06,592 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1297, PETRI_PLACES=578, PETRI_TRANSITIONS=576} [2024-11-10 14:38:06,592 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -26 predicate places. [2024-11-10 14:38:06,592 INFO L471 AbstractCegarLoop]: Abstraction has has 578 places, 576 transitions, 1297 flow [2024-11-10 14:38:06,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:06,593 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:06,593 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:06,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 14:38:06,594 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:06,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:06,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2051712507, now seen corresponding path program 1 times [2024-11-10 14:38:06,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:06,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284300154] [2024-11-10 14:38:06,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:06,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:06,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:06,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:06,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284300154] [2024-11-10 14:38:06,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284300154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:06,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:06,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:38:06,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556785532] [2024-11-10 14:38:06,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:06,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:38:06,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:06,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:38:06,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:38:07,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 649 [2024-11-10 14:38:07,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 578 places, 576 transitions, 1297 flow. Second operand has 8 states, 8 states have (on average 593.25) internal successors, (4746), 8 states have internal predecessors, (4746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:07,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:07,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 649 [2024-11-10 14:38:07,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:09,043 INFO L124 PetriNetUnfolderBase]: 701/8599 cut-off events. [2024-11-10 14:38:09,043 INFO L125 PetriNetUnfolderBase]: For 151/268 co-relation queries the response was YES. [2024-11-10 14:38:09,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10150 conditions, 8599 events. 701/8599 cut-off events. For 151/268 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 94339 event pairs, 150 based on Foata normal form. 16/7598 useless extension candidates. Maximal degree in co-relation 10058. Up to 473 conditions per place. [2024-11-10 14:38:09,172 INFO L140 encePairwiseOnDemand]: 634/649 looper letters, 66 selfloop transitions, 16 changer transitions 0/606 dead transitions. [2024-11-10 14:38:09,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 606 transitions, 1537 flow [2024-11-10 14:38:09,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 14:38:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 14:38:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6556 transitions. [2024-11-10 14:38:09,180 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9183359013867488 [2024-11-10 14:38:09,180 INFO L175 Difference]: Start difference. First operand has 578 places, 576 transitions, 1297 flow. Second operand 11 states and 6556 transitions. [2024-11-10 14:38:09,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 606 transitions, 1537 flow [2024-11-10 14:38:09,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 606 transitions, 1533 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:09,189 INFO L231 Difference]: Finished difference. Result has 591 places, 585 transitions, 1377 flow [2024-11-10 14:38:09,190 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=576, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1377, PETRI_PLACES=591, PETRI_TRANSITIONS=585} [2024-11-10 14:38:09,191 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -13 predicate places. [2024-11-10 14:38:09,191 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 585 transitions, 1377 flow [2024-11-10 14:38:09,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 593.25) internal successors, (4746), 8 states have internal predecessors, (4746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:09,192 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:09,192 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:09,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 14:38:09,192 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:09,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:09,193 INFO L85 PathProgramCache]: Analyzing trace with hash 249050257, now seen corresponding path program 1 times [2024-11-10 14:38:09,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:09,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168257482] [2024-11-10 14:38:09,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:09,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:09,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:09,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:09,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168257482] [2024-11-10 14:38:09,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168257482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:09,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:09,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:38:09,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407674698] [2024-11-10 14:38:09,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:09,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:09,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:09,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:09,252 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-10 14:38:09,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 585 transitions, 1377 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:09,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:09,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-10 14:38:09,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:10,306 INFO L124 PetriNetUnfolderBase]: 708/6586 cut-off events. [2024-11-10 14:38:10,306 INFO L125 PetriNetUnfolderBase]: For 366/437 co-relation queries the response was YES. [2024-11-10 14:38:10,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8239 conditions, 6586 events. 708/6586 cut-off events. For 366/437 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 67805 event pairs, 204 based on Foata normal form. 0/5740 useless extension candidates. Maximal degree in co-relation 8141. Up to 755 conditions per place. [2024-11-10 14:38:10,416 INFO L140 encePairwiseOnDemand]: 645/649 looper letters, 14 selfloop transitions, 3 changer transitions 0/588 dead transitions. [2024-11-10 14:38:10,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 588 transitions, 1419 flow [2024-11-10 14:38:10,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:10,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1881 transitions. [2024-11-10 14:38:10,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9661016949152542 [2024-11-10 14:38:10,419 INFO L175 Difference]: Start difference. First operand has 591 places, 585 transitions, 1377 flow. Second operand 3 states and 1881 transitions. [2024-11-10 14:38:10,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 588 transitions, 1419 flow [2024-11-10 14:38:10,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 588 transitions, 1415 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:38:10,427 INFO L231 Difference]: Finished difference. Result has 594 places, 586 transitions, 1391 flow [2024-11-10 14:38:10,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1391, PETRI_PLACES=594, PETRI_TRANSITIONS=586} [2024-11-10 14:38:10,428 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -10 predicate places. [2024-11-10 14:38:10,428 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 586 transitions, 1391 flow [2024-11-10 14:38:10,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:10,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:10,429 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:10,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 14:38:10,429 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:10,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash -515348008, now seen corresponding path program 1 times [2024-11-10 14:38:10,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:10,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300900804] [2024-11-10 14:38:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:10,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:10,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:10,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300900804] [2024-11-10 14:38:10,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300900804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:10,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:10,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:10,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672775355] [2024-11-10 14:38:10,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:10,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:10,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:10,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:10,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:10,493 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-10 14:38:10,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 586 transitions, 1391 flow. Second operand has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:10,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:10,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-10 14:38:10,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:11,351 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1641] thread3EXIT-->L127-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][536], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), 766#true, 2#L127-16true, 661#(= |#race~n2~0| 0), 733#(= |#race~get2~0| 0), Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 693#(= |#race~get1~0| 0), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 731#true, 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), 667#(= |#race~n3~0| 0), 681#(= |#race~count3~0| 0), 677#(= |#race~count2~0| 0), Black: 691#true, Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 771#true, Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|)]) [2024-11-10 14:38:11,351 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-10 14:38:11,351 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2024-11-10 14:38:11,351 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-10 14:38:11,351 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2024-11-10 14:38:11,355 INFO L124 PetriNetUnfolderBase]: 491/5354 cut-off events. [2024-11-10 14:38:11,355 INFO L125 PetriNetUnfolderBase]: For 291/360 co-relation queries the response was YES. [2024-11-10 14:38:11,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6876 conditions, 5354 events. 491/5354 cut-off events. For 291/360 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 51609 event pairs, 86 based on Foata normal form. 2/4844 useless extension candidates. Maximal degree in co-relation 6778. Up to 414 conditions per place. [2024-11-10 14:38:11,438 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2024-11-10 14:38:11,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 587 transitions, 1425 flow [2024-11-10 14:38:11,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:11,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1879 transitions. [2024-11-10 14:38:11,440 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650744735490498 [2024-11-10 14:38:11,440 INFO L175 Difference]: Start difference. First operand has 594 places, 586 transitions, 1391 flow. Second operand 3 states and 1879 transitions. [2024-11-10 14:38:11,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 587 transitions, 1425 flow [2024-11-10 14:38:11,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 587 transitions, 1419 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:11,447 INFO L231 Difference]: Finished difference. Result has 593 places, 585 transitions, 1387 flow [2024-11-10 14:38:11,448 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=591, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1387, PETRI_PLACES=593, PETRI_TRANSITIONS=585} [2024-11-10 14:38:11,448 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -11 predicate places. [2024-11-10 14:38:11,448 INFO L471 AbstractCegarLoop]: Abstraction has has 593 places, 585 transitions, 1387 flow [2024-11-10 14:38:11,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:11,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:11,449 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:11,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 14:38:11,449 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:11,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:11,450 INFO L85 PathProgramCache]: Analyzing trace with hash 615974862, now seen corresponding path program 1 times [2024-11-10 14:38:11,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:11,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583202792] [2024-11-10 14:38:11,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:11,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:11,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:11,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:11,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583202792] [2024-11-10 14:38:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583202792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:11,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:11,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:38:11,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543752554] [2024-11-10 14:38:11,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:11,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:38:11,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:38:11,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:38:12,105 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 649 [2024-11-10 14:38:12,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 585 transitions, 1387 flow. Second operand has 8 states, 8 states have (on average 593.375) internal successors, (4747), 8 states have internal predecessors, (4747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:12,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:12,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 649 [2024-11-10 14:38:12,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:13,115 INFO L124 PetriNetUnfolderBase]: 608/5617 cut-off events. [2024-11-10 14:38:13,115 INFO L125 PetriNetUnfolderBase]: For 389/486 co-relation queries the response was YES. [2024-11-10 14:38:13,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7593 conditions, 5617 events. 608/5617 cut-off events. For 389/486 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 52425 event pairs, 179 based on Foata normal form. 17/5050 useless extension candidates. Maximal degree in co-relation 7493. Up to 683 conditions per place. [2024-11-10 14:38:13,213 INFO L140 encePairwiseOnDemand]: 632/649 looper letters, 79 selfloop transitions, 19 changer transitions 0/626 dead transitions. [2024-11-10 14:38:13,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 626 transitions, 1713 flow [2024-11-10 14:38:13,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:38:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 14:38:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7157 transitions. [2024-11-10 14:38:13,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9189779147406266 [2024-11-10 14:38:13,218 INFO L175 Difference]: Start difference. First operand has 593 places, 585 transitions, 1387 flow. Second operand 12 states and 7157 transitions. [2024-11-10 14:38:13,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 626 transitions, 1713 flow [2024-11-10 14:38:13,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 626 transitions, 1709 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:13,232 INFO L231 Difference]: Finished difference. Result has 606 places, 590 transitions, 1463 flow [2024-11-10 14:38:13,232 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1383, PETRI_DIFFERENCE_MINUEND_PLACES=591, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1463, PETRI_PLACES=606, PETRI_TRANSITIONS=590} [2024-11-10 14:38:13,233 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 2 predicate places. [2024-11-10 14:38:13,233 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 590 transitions, 1463 flow [2024-11-10 14:38:13,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 593.375) internal successors, (4747), 8 states have internal predecessors, (4747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:13,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:13,234 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:13,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 14:38:13,235 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:13,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:13,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1341461688, now seen corresponding path program 1 times [2024-11-10 14:38:13,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:13,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177437402] [2024-11-10 14:38:13,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:13,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:38:13,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:13,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177437402] [2024-11-10 14:38:13,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177437402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:13,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:13,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:38:13,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308972861] [2024-11-10 14:38:13,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:13,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:38:13,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:13,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:38:13,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:38:13,806 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 649 [2024-11-10 14:38:13,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 590 transitions, 1463 flow. Second operand has 8 states, 8 states have (on average 593.25) internal successors, (4746), 8 states have internal predecessors, (4746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:13,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:13,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 649 [2024-11-10 14:38:13,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:14,768 INFO L124 PetriNetUnfolderBase]: 416/5747 cut-off events. [2024-11-10 14:38:14,769 INFO L125 PetriNetUnfolderBase]: For 317/340 co-relation queries the response was YES. [2024-11-10 14:38:14,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7656 conditions, 5747 events. 416/5747 cut-off events. For 317/340 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 53349 event pairs, 52 based on Foata normal form. 2/5288 useless extension candidates. Maximal degree in co-relation 7549. Up to 215 conditions per place. [2024-11-10 14:38:14,880 INFO L140 encePairwiseOnDemand]: 632/649 looper letters, 71 selfloop transitions, 24 changer transitions 0/624 dead transitions. [2024-11-10 14:38:14,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 624 transitions, 1769 flow [2024-11-10 14:38:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:38:14,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 14:38:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7150 transitions. [2024-11-10 14:38:14,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9180790960451978 [2024-11-10 14:38:14,885 INFO L175 Difference]: Start difference. First operand has 606 places, 590 transitions, 1463 flow. Second operand 12 states and 7150 transitions. [2024-11-10 14:38:14,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 624 transitions, 1769 flow [2024-11-10 14:38:14,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 624 transitions, 1752 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 14:38:14,899 INFO L231 Difference]: Finished difference. Result has 615 places, 599 transitions, 1579 flow [2024-11-10 14:38:14,899 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1579, PETRI_PLACES=615, PETRI_TRANSITIONS=599} [2024-11-10 14:38:14,900 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 11 predicate places. [2024-11-10 14:38:14,900 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 599 transitions, 1579 flow [2024-11-10 14:38:14,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 593.25) internal successors, (4746), 8 states have internal predecessors, (4746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:14,901 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:14,902 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:14,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 14:38:14,902 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:14,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:14,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1968521897, now seen corresponding path program 1 times [2024-11-10 14:38:14,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:14,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984031574] [2024-11-10 14:38:14,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:14,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:38:15,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:15,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984031574] [2024-11-10 14:38:15,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984031574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:15,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:15,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:38:15,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383700101] [2024-11-10 14:38:15,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:15,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:38:15,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:15,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:38:15,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:38:15,518 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 649 [2024-11-10 14:38:15,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 599 transitions, 1579 flow. Second operand has 8 states, 8 states have (on average 593.375) internal successors, (4747), 8 states have internal predecessors, (4747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:15,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:15,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 649 [2024-11-10 14:38:15,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:17,333 INFO L124 PetriNetUnfolderBase]: 940/11028 cut-off events. [2024-11-10 14:38:17,333 INFO L125 PetriNetUnfolderBase]: For 1023/1158 co-relation queries the response was YES. [2024-11-10 14:38:17,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15190 conditions, 11028 events. 940/11028 cut-off events. For 1023/1158 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 124885 event pairs, 192 based on Foata normal form. 4/10121 useless extension candidates. Maximal degree in co-relation 15075. Up to 594 conditions per place. [2024-11-10 14:38:17,546 INFO L140 encePairwiseOnDemand]: 633/649 looper letters, 69 selfloop transitions, 20 changer transitions 0/627 dead transitions. [2024-11-10 14:38:17,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 627 transitions, 1859 flow [2024-11-10 14:38:17,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 14:38:17,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 14:38:17,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6549 transitions. [2024-11-10 14:38:17,550 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9173553719008265 [2024-11-10 14:38:17,550 INFO L175 Difference]: Start difference. First operand has 615 places, 599 transitions, 1579 flow. Second operand 11 states and 6549 transitions. [2024-11-10 14:38:17,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 627 transitions, 1859 flow [2024-11-10 14:38:17,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 627 transitions, 1842 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 14:38:17,571 INFO L231 Difference]: Finished difference. Result has 624 places, 612 transitions, 1700 flow [2024-11-10 14:38:17,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1562, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1700, PETRI_PLACES=624, PETRI_TRANSITIONS=612} [2024-11-10 14:38:17,572 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 20 predicate places. [2024-11-10 14:38:17,572 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 612 transitions, 1700 flow [2024-11-10 14:38:17,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 593.375) internal successors, (4747), 8 states have internal predecessors, (4747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:17,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:17,574 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:17,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 14:38:17,574 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:17,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:17,575 INFO L85 PathProgramCache]: Analyzing trace with hash 504860474, now seen corresponding path program 1 times [2024-11-10 14:38:17,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:17,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319260482] [2024-11-10 14:38:17,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:17,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:38:17,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:17,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319260482] [2024-11-10 14:38:17,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319260482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:17,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:17,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:38:17,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124058468] [2024-11-10 14:38:17,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:17,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:38:17,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:17,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:38:17,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:38:18,208 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 649 [2024-11-10 14:38:18,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 612 transitions, 1700 flow. Second operand has 8 states, 8 states have (on average 593.5) internal successors, (4748), 8 states have internal predecessors, (4748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:18,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:18,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 649 [2024-11-10 14:38:18,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:19,432 INFO L124 PetriNetUnfolderBase]: 761/7097 cut-off events. [2024-11-10 14:38:19,432 INFO L125 PetriNetUnfolderBase]: For 1388/1508 co-relation queries the response was YES. [2024-11-10 14:38:19,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10711 conditions, 7097 events. 761/7097 cut-off events. For 1388/1508 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 69739 event pairs, 234 based on Foata normal form. 19/6537 useless extension candidates. Maximal degree in co-relation 10587. Up to 915 conditions per place. [2024-11-10 14:38:19,528 INFO L140 encePairwiseOnDemand]: 633/649 looper letters, 70 selfloop transitions, 21 changer transitions 0/636 dead transitions. [2024-11-10 14:38:19,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 636 transitions, 1987 flow [2024-11-10 14:38:19,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 14:38:19,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 14:38:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6549 transitions. [2024-11-10 14:38:19,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9173553719008265 [2024-11-10 14:38:19,532 INFO L175 Difference]: Start difference. First operand has 624 places, 612 transitions, 1700 flow. Second operand 11 states and 6549 transitions. [2024-11-10 14:38:19,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 636 transitions, 1987 flow [2024-11-10 14:38:19,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 636 transitions, 1983 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:38:19,548 INFO L231 Difference]: Finished difference. Result has 636 places, 621 transitions, 1829 flow [2024-11-10 14:38:19,549 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1696, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1829, PETRI_PLACES=636, PETRI_TRANSITIONS=621} [2024-11-10 14:38:19,549 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 32 predicate places. [2024-11-10 14:38:19,549 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 621 transitions, 1829 flow [2024-11-10 14:38:19,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 593.5) internal successors, (4748), 8 states have internal predecessors, (4748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:19,551 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:19,551 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:38:19,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 14:38:19,551 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:19,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:19,552 INFO L85 PathProgramCache]: Analyzing trace with hash -325547756, now seen corresponding path program 1 times [2024-11-10 14:38:19,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:19,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958953727] [2024-11-10 14:38:19,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:19,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:20,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:20,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958953727] [2024-11-10 14:38:20,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958953727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:20,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:20,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:38:20,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343008595] [2024-11-10 14:38:20,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:20,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:38:20,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:20,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:38:20,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:38:20,661 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 600 out of 649 [2024-11-10 14:38:20,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 621 transitions, 1829 flow. Second operand has 6 states, 6 states have (on average 602.8333333333334) internal successors, (3617), 6 states have internal predecessors, (3617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:20,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:20,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 600 of 649 [2024-11-10 14:38:20,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:22,238 INFO L124 PetriNetUnfolderBase]: 682/9730 cut-off events. [2024-11-10 14:38:22,238 INFO L125 PetriNetUnfolderBase]: For 2257/2321 co-relation queries the response was YES. [2024-11-10 14:38:22,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14096 conditions, 9730 events. 682/9730 cut-off events. For 2257/2321 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 101784 event pairs, 45 based on Foata normal form. 10/9049 useless extension candidates. Maximal degree in co-relation 13968. Up to 286 conditions per place. [2024-11-10 14:38:22,426 INFO L140 encePairwiseOnDemand]: 641/649 looper letters, 42 selfloop transitions, 6 changer transitions 0/628 dead transitions. [2024-11-10 14:38:22,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 628 transitions, 1951 flow [2024-11-10 14:38:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:38:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:38:22,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3644 transitions. [2024-11-10 14:38:22,429 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357986646122239 [2024-11-10 14:38:22,429 INFO L175 Difference]: Start difference. First operand has 636 places, 621 transitions, 1829 flow. Second operand 6 states and 3644 transitions. [2024-11-10 14:38:22,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 628 transitions, 1951 flow [2024-11-10 14:38:22,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 628 transitions, 1930 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-10 14:38:22,462 INFO L231 Difference]: Finished difference. Result has 633 places, 620 transitions, 1827 flow [2024-11-10 14:38:22,462 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1804, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=619, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=613, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1827, PETRI_PLACES=633, PETRI_TRANSITIONS=620} [2024-11-10 14:38:22,463 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 29 predicate places. [2024-11-10 14:38:22,463 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 620 transitions, 1827 flow [2024-11-10 14:38:22,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 602.8333333333334) internal successors, (3617), 6 states have internal predecessors, (3617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:22,463 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:22,464 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:38:22,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 14:38:22,464 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:22,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:22,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1474185566, now seen corresponding path program 1 times [2024-11-10 14:38:22,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:22,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568895041] [2024-11-10 14:38:22,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:22,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:23,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:23,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568895041] [2024-11-10 14:38:23,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568895041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:23,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:23,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:38:23,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150754766] [2024-11-10 14:38:23,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:23,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:38:23,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:23,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:38:23,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:38:23,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 600 out of 649 [2024-11-10 14:38:23,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 620 transitions, 1827 flow. Second operand has 6 states, 6 states have (on average 603.0) internal successors, (3618), 6 states have internal predecessors, (3618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:23,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:23,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 600 of 649 [2024-11-10 14:38:23,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:25,265 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1566] L90-20-->L90-19: Formula: (= |v_#race~get1~0_12| 0) InVars {} OutVars{#race~get1~0=|v_#race~get1~0_12|} AuxVars[] AssignedVars[#race~get1~0][557], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), 661#(= |#race~n2~0| 0), 877#true, 733#(= |#race~get2~0| 0), 798#true, 593#L50-19true, Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), 667#(= |#race~n3~0| 0), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 803#(<= ~n2~0 0), Black: 691#true, 774#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 827#(<= ~n3~0 0), Black: 835#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 828#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 353#L122-1true, Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 693#(= |#race~get1~0| 0), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 731#true, Black: 852#(<= ~n3~0 0), Black: 853#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 866#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), 122#L76true, Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), 677#(= |#race~count2~0| 0), Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 870#true, 293#L90-19true]) [2024-11-10 14:38:25,265 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-11-10 14:38:25,265 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-10 14:38:25,265 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-10 14:38:25,265 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2024-11-10 14:38:25,278 INFO L124 PetriNetUnfolderBase]: 734/10403 cut-off events. [2024-11-10 14:38:25,279 INFO L125 PetriNetUnfolderBase]: For 2679/2881 co-relation queries the response was YES. [2024-11-10 14:38:25,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15091 conditions, 10403 events. 734/10403 cut-off events. For 2679/2881 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 109939 event pairs, 70 based on Foata normal form. 11/9621 useless extension candidates. Maximal degree in co-relation 14963. Up to 376 conditions per place. [2024-11-10 14:38:25,466 INFO L140 encePairwiseOnDemand]: 641/649 looper letters, 42 selfloop transitions, 6 changer transitions 0/627 dead transitions. [2024-11-10 14:38:25,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 627 transitions, 1949 flow [2024-11-10 14:38:25,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:38:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:38:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3644 transitions. [2024-11-10 14:38:25,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357986646122239 [2024-11-10 14:38:25,468 INFO L175 Difference]: Start difference. First operand has 633 places, 620 transitions, 1827 flow. Second operand 6 states and 3644 transitions. [2024-11-10 14:38:25,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 627 transitions, 1949 flow [2024-11-10 14:38:25,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 627 transitions, 1936 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-10 14:38:25,501 INFO L231 Difference]: Finished difference. Result has 633 places, 619 transitions, 1833 flow [2024-11-10 14:38:25,502 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=612, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1833, PETRI_PLACES=633, PETRI_TRANSITIONS=619} [2024-11-10 14:38:25,502 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 29 predicate places. [2024-11-10 14:38:25,502 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 619 transitions, 1833 flow [2024-11-10 14:38:25,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 603.0) internal successors, (3618), 6 states have internal predecessors, (3618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:25,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:25,503 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:38:25,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-10 14:38:25,504 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:25,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:25,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1890468104, now seen corresponding path program 1 times [2024-11-10 14:38:25,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:25,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556928804] [2024-11-10 14:38:25,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:25,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:25,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:25,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556928804] [2024-11-10 14:38:25,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556928804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:25,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:25,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:38:25,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177870967] [2024-11-10 14:38:25,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:25,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:38:25,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:25,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:38:25,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:38:26,562 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 600 out of 649 [2024-11-10 14:38:26,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 633 places, 619 transitions, 1833 flow. Second operand has 6 states, 6 states have (on average 602.8333333333334) internal successors, (3617), 6 states have internal predecessors, (3617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:26,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:26,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 600 of 649 [2024-11-10 14:38:26,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:28,047 INFO L124 PetriNetUnfolderBase]: 655/9613 cut-off events. [2024-11-10 14:38:28,047 INFO L125 PetriNetUnfolderBase]: For 2340/2404 co-relation queries the response was YES. [2024-11-10 14:38:28,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13980 conditions, 9613 events. 655/9613 cut-off events. For 2340/2404 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 99928 event pairs, 45 based on Foata normal form. 10/8975 useless extension candidates. Maximal degree in co-relation 13851. Up to 286 conditions per place. [2024-11-10 14:38:28,221 INFO L140 encePairwiseOnDemand]: 641/649 looper letters, 42 selfloop transitions, 6 changer transitions 0/625 dead transitions. [2024-11-10 14:38:28,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 625 transitions, 1949 flow [2024-11-10 14:38:28,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:38:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:38:28,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3644 transitions. [2024-11-10 14:38:28,225 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357986646122239 [2024-11-10 14:38:28,225 INFO L175 Difference]: Start difference. First operand has 633 places, 619 transitions, 1833 flow. Second operand 6 states and 3644 transitions. [2024-11-10 14:38:28,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 625 transitions, 1949 flow [2024-11-10 14:38:28,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 625 transitions, 1936 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-10 14:38:28,258 INFO L231 Difference]: Finished difference. Result has 632 places, 617 transitions, 1828 flow [2024-11-10 14:38:28,259 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=617, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1828, PETRI_PLACES=632, PETRI_TRANSITIONS=617} [2024-11-10 14:38:28,259 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 28 predicate places. [2024-11-10 14:38:28,259 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 617 transitions, 1828 flow [2024-11-10 14:38:28,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 602.8333333333334) internal successors, (3617), 6 states have internal predecessors, (3617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:28,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:28,260 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:38:28,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-10 14:38:28,261 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:28,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:28,261 INFO L85 PathProgramCache]: Analyzing trace with hash -646832545, now seen corresponding path program 1 times [2024-11-10 14:38:28,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:28,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506130356] [2024-11-10 14:38:28,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:28,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:28,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:28,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:28,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506130356] [2024-11-10 14:38:28,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506130356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:28,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:28,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:28,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084483169] [2024-11-10 14:38:28,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:28,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:28,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:28,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:28,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:28,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 649 [2024-11-10 14:38:28,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 617 transitions, 1828 flow. Second operand has 3 states, 3 states have (on average 617.6666666666666) internal successors, (1853), 3 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:28,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:28,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 649 [2024-11-10 14:38:28,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:30,091 INFO L124 PetriNetUnfolderBase]: 774/9780 cut-off events. [2024-11-10 14:38:30,091 INFO L125 PetriNetUnfolderBase]: For 1570/1595 co-relation queries the response was YES. [2024-11-10 14:38:30,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13414 conditions, 9780 events. 774/9780 cut-off events. For 1570/1595 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 96665 event pairs, 86 based on Foata normal form. 0/9051 useless extension candidates. Maximal degree in co-relation 13286. Up to 557 conditions per place. [2024-11-10 14:38:30,191 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 19 selfloop transitions, 2 changer transitions 0/619 dead transitions. [2024-11-10 14:38:30,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 619 transitions, 1878 flow [2024-11-10 14:38:30,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:30,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1873 transitions. [2024-11-10 14:38:30,193 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9619928094504365 [2024-11-10 14:38:30,193 INFO L175 Difference]: Start difference. First operand has 632 places, 617 transitions, 1828 flow. Second operand 3 states and 1873 transitions. [2024-11-10 14:38:30,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 619 transitions, 1878 flow [2024-11-10 14:38:30,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 619 transitions, 1866 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:38:30,206 INFO L231 Difference]: Finished difference. Result has 626 places, 615 transitions, 1822 flow [2024-11-10 14:38:30,206 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1822, PETRI_PLACES=626, PETRI_TRANSITIONS=615} [2024-11-10 14:38:30,207 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 22 predicate places. [2024-11-10 14:38:30,207 INFO L471 AbstractCegarLoop]: Abstraction has has 626 places, 615 transitions, 1822 flow [2024-11-10 14:38:30,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 617.6666666666666) internal successors, (1853), 3 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:30,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:30,208 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:38:30,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-10 14:38:30,208 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:30,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:30,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2098095615, now seen corresponding path program 1 times [2024-11-10 14:38:30,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:30,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400019549] [2024-11-10 14:38:30,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:30,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:30,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:30,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:30,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400019549] [2024-11-10 14:38:30,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400019549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:30,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:30,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:38:30,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289043123] [2024-11-10 14:38:30,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:30,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:38:30,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:30,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:38:30,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:38:31,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 600 out of 649 [2024-11-10 14:38:31,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 626 places, 615 transitions, 1822 flow. Second operand has 6 states, 6 states have (on average 603.1666666666666) internal successors, (3619), 6 states have internal predecessors, (3619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:31,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:31,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 600 of 649 [2024-11-10 14:38:31,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:32,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1642] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][592], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), 661#(= |#race~n2~0| 0), 733#(= |#race~get2~0| 0), 798#true, 244#L90-16true, Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 667#(= |#race~n3~0| 0), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), Black: 803#(<= ~n2~0 0), Black: 691#true, 774#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), 896#(= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0), Black: 827#(<= ~n3~0 0), Black: 835#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 828#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 693#(= |#race~get1~0| 0), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 731#true, 256#L125true, Black: 852#(<= ~n3~0 0), Black: 853#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 866#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), 892#(= |#race~get3~0| 0), Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 677#(= |#race~count2~0| 0), Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 890#true, Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-10 14:38:32,350 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2024-11-10 14:38:32,350 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-10 14:38:32,350 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2024-11-10 14:38:32,350 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-10 14:38:32,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1642] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][596], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), 661#(= |#race~n2~0| 0), 733#(= |#race~get2~0| 0), 798#true, Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 667#(= |#race~n3~0| 0), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), Black: 803#(<= ~n2~0 0), Black: 691#true, 774#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 827#(<= ~n3~0 0), Black: 835#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 828#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 897#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0)), Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 693#(= |#race~get1~0| 0), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), 264#L90-15true, Black: 731#true, 256#L125true, Black: 852#(<= ~n3~0 0), Black: 853#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 866#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), 892#(= |#race~get3~0| 0), Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 677#(= |#race~count2~0| 0), Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 890#true, Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-10 14:38:32,354 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2024-11-10 14:38:32,354 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-10 14:38:32,354 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-10 14:38:32,354 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2024-11-10 14:38:32,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1642] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][599], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), 661#(= |#race~n2~0| 0), 733#(= |#race~get2~0| 0), 798#true, Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 667#(= |#race~n3~0| 0), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), Black: 803#(<= ~n2~0 0), Black: 691#true, 31#L90-14true, 898#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 774#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 827#(<= ~n3~0 0), Black: 835#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 828#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 693#(= |#race~get1~0| 0), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 731#true, 256#L125true, Black: 852#(<= ~n3~0 0), Black: 853#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 866#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), 892#(= |#race~get3~0| 0), Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 677#(= |#race~count2~0| 0), Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 890#true, Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-10 14:38:32,357 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2024-11-10 14:38:32,357 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-10 14:38:32,357 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-10 14:38:32,357 INFO L297 olderBase$Statistics]: existing Event has 334 ancestors and is cut-off event [2024-11-10 14:38:32,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1642] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][603], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), 661#(= |#race~n2~0| 0), 733#(= |#race~get2~0| 0), 798#true, Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 667#(= |#race~n3~0| 0), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), Black: 803#(<= ~n2~0 0), Black: 691#true, 774#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), 50#L90-13true, Black: 827#(<= ~n3~0 0), Black: 835#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 828#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 899#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 693#(= |#race~get1~0| 0), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 731#true, 256#L125true, Black: 852#(<= ~n3~0 0), Black: 853#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 866#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), 892#(= |#race~get3~0| 0), Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 677#(= |#race~count2~0| 0), Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 890#true, Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-10 14:38:32,360 INFO L294 olderBase$Statistics]: this new event has 366 ancestors and is cut-off event [2024-11-10 14:38:32,360 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-11-10 14:38:32,361 INFO L297 olderBase$Statistics]: existing Event has 366 ancestors and is cut-off event [2024-11-10 14:38:32,361 INFO L297 olderBase$Statistics]: existing Event has 366 ancestors and is cut-off event [2024-11-10 14:38:32,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1642] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][603], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), 661#(= |#race~n2~0| 0), 733#(= |#race~get2~0| 0), 798#true, Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 667#(= |#race~n3~0| 0), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), Black: 803#(<= ~n2~0 0), Black: 691#true, 774#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), 113#L90-12true, Black: 827#(<= ~n3~0 0), Black: 835#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 828#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 899#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 693#(= |#race~get1~0| 0), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 731#true, 256#L125true, Black: 852#(<= ~n3~0 0), Black: 853#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 866#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), 892#(= |#race~get3~0| 0), Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 677#(= |#race~count2~0| 0), Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 890#true, Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2024-11-10 14:38:32,364 INFO L294 olderBase$Statistics]: this new event has 367 ancestors and is cut-off event [2024-11-10 14:38:32,364 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2024-11-10 14:38:32,364 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2024-11-10 14:38:32,364 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2024-11-10 14:38:32,386 INFO L124 PetriNetUnfolderBase]: 711/7197 cut-off events. [2024-11-10 14:38:32,386 INFO L125 PetriNetUnfolderBase]: For 2404/2640 co-relation queries the response was YES. [2024-11-10 14:38:32,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11088 conditions, 7197 events. 711/7197 cut-off events. For 2404/2640 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 69595 event pairs, 97 based on Foata normal form. 33/6798 useless extension candidates. Maximal degree in co-relation 10959. Up to 461 conditions per place. [2024-11-10 14:38:32,524 INFO L140 encePairwiseOnDemand]: 641/649 looper letters, 42 selfloop transitions, 6 changer transitions 0/622 dead transitions. [2024-11-10 14:38:32,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 622 transitions, 1944 flow [2024-11-10 14:38:32,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:38:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:38:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3644 transitions. [2024-11-10 14:38:32,527 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357986646122239 [2024-11-10 14:38:32,527 INFO L175 Difference]: Start difference. First operand has 626 places, 615 transitions, 1822 flow. Second operand 6 states and 3644 transitions. [2024-11-10 14:38:32,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 622 transitions, 1944 flow [2024-11-10 14:38:32,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 622 transitions, 1944 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:38:32,543 INFO L231 Difference]: Finished difference. Result has 630 places, 614 transitions, 1841 flow [2024-11-10 14:38:32,544 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1818, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1841, PETRI_PLACES=630, PETRI_TRANSITIONS=614} [2024-11-10 14:38:32,544 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 26 predicate places. [2024-11-10 14:38:32,544 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 614 transitions, 1841 flow [2024-11-10 14:38:32,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 603.1666666666666) internal successors, (3619), 6 states have internal predecessors, (3619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:32,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:32,545 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:38:32,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-10 14:38:32,545 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:32,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:32,546 INFO L85 PathProgramCache]: Analyzing trace with hash 266706370, now seen corresponding path program 1 times [2024-11-10 14:38:32,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:32,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425608308] [2024-11-10 14:38:32,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:32,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:32,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:32,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:32,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425608308] [2024-11-10 14:38:32,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425608308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:32,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:32,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:38:32,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840003734] [2024-11-10 14:38:32,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:33,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:38:33,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:33,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:38:33,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:38:33,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 600 out of 649 [2024-11-10 14:38:33,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 614 transitions, 1841 flow. Second operand has 6 states, 6 states have (on average 603.0) internal successors, (3618), 6 states have internal predecessors, (3618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:33,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:33,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 600 of 649 [2024-11-10 14:38:33,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:35,319 INFO L124 PetriNetUnfolderBase]: 778/10907 cut-off events. [2024-11-10 14:38:35,319 INFO L125 PetriNetUnfolderBase]: For 3037/3244 co-relation queries the response was YES. [2024-11-10 14:38:35,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16464 conditions, 10907 events. 778/10907 cut-off events. For 3037/3244 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 116865 event pairs, 76 based on Foata normal form. 15/10303 useless extension candidates. Maximal degree in co-relation 16333. Up to 419 conditions per place. [2024-11-10 14:38:35,533 INFO L140 encePairwiseOnDemand]: 641/649 looper letters, 42 selfloop transitions, 6 changer transitions 0/620 dead transitions. [2024-11-10 14:38:35,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 620 transitions, 1957 flow [2024-11-10 14:38:35,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:38:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:38:35,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3644 transitions. [2024-11-10 14:38:35,537 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357986646122239 [2024-11-10 14:38:35,537 INFO L175 Difference]: Start difference. First operand has 630 places, 614 transitions, 1841 flow. Second operand 6 states and 3644 transitions. [2024-11-10 14:38:35,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 620 transitions, 1957 flow [2024-11-10 14:38:35,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 620 transitions, 1944 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-10 14:38:35,582 INFO L231 Difference]: Finished difference. Result has 629 places, 612 transitions, 1836 flow [2024-11-10 14:38:35,583 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1824, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1836, PETRI_PLACES=629, PETRI_TRANSITIONS=612} [2024-11-10 14:38:35,583 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 25 predicate places. [2024-11-10 14:38:35,583 INFO L471 AbstractCegarLoop]: Abstraction has has 629 places, 612 transitions, 1836 flow [2024-11-10 14:38:35,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 603.0) internal successors, (3618), 6 states have internal predecessors, (3618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:35,584 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:35,584 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:35,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-10 14:38:35,585 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:35,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:35,585 INFO L85 PathProgramCache]: Analyzing trace with hash -375238124, now seen corresponding path program 1 times [2024-11-10 14:38:35,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:35,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050103854] [2024-11-10 14:38:35,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:35,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:35,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:35,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:35,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050103854] [2024-11-10 14:38:35,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050103854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:35,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:35,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:35,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269855648] [2024-11-10 14:38:35,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:35,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:35,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:35,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:35,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:35,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 649 [2024-11-10 14:38:35,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 629 places, 612 transitions, 1836 flow. Second operand has 3 states, 3 states have (on average 626.0) internal successors, (1878), 3 states have internal predecessors, (1878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:35,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:35,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 649 [2024-11-10 14:38:35,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:37,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1641] thread3EXIT-->L127-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][432], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), Black: 899#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 661#(= |#race~n2~0| 0), 733#(= |#race~get2~0| 0), 798#true, Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), 667#(= |#race~n3~0| 0), Black: 803#(<= ~n2~0 0), Black: 691#true, 774#true, 907#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), 2#L127-16true, Black: 827#(<= ~n3~0 0), Black: 835#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 828#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 693#(= |#race~get1~0| 0), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 731#true, Black: 852#(<= ~n3~0 0), Black: 853#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 866#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), 901#true, 892#(= |#race~get3~0| 0), Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 677#(= |#race~count2~0| 0), Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 890#true]) [2024-11-10 14:38:37,387 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is not cut-off event [2024-11-10 14:38:37,387 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is not cut-off event [2024-11-10 14:38:37,387 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is not cut-off event [2024-11-10 14:38:37,387 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is not cut-off event [2024-11-10 14:38:37,414 INFO L124 PetriNetUnfolderBase]: 683/10538 cut-off events. [2024-11-10 14:38:37,414 INFO L125 PetriNetUnfolderBase]: For 2291/2326 co-relation queries the response was YES. [2024-11-10 14:38:37,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15208 conditions, 10538 events. 683/10538 cut-off events. For 2291/2326 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 108627 event pairs, 51 based on Foata normal form. 0/9970 useless extension candidates. Maximal degree in co-relation 15078. Up to 320 conditions per place. [2024-11-10 14:38:37,615 INFO L140 encePairwiseOnDemand]: 647/649 looper letters, 10 selfloop transitions, 1 changer transitions 0/611 dead transitions. [2024-11-10 14:38:37,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 611 transitions, 1856 flow [2024-11-10 14:38:37,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:37,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1881 transitions. [2024-11-10 14:38:37,617 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9661016949152542 [2024-11-10 14:38:37,617 INFO L175 Difference]: Start difference. First operand has 629 places, 612 transitions, 1836 flow. Second operand 3 states and 1881 transitions. [2024-11-10 14:38:37,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 611 transitions, 1856 flow [2024-11-10 14:38:37,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 611 transitions, 1844 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:38:37,645 INFO L231 Difference]: Finished difference. Result has 625 places, 611 transitions, 1824 flow [2024-11-10 14:38:37,645 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1822, PETRI_DIFFERENCE_MINUEND_PLACES=623, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1824, PETRI_PLACES=625, PETRI_TRANSITIONS=611} [2024-11-10 14:38:37,646 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 21 predicate places. [2024-11-10 14:38:37,646 INFO L471 AbstractCegarLoop]: Abstraction has has 625 places, 611 transitions, 1824 flow [2024-11-10 14:38:37,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.0) internal successors, (1878), 3 states have internal predecessors, (1878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:37,647 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:37,647 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:38:37,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-10 14:38:37,647 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:37,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1031906277, now seen corresponding path program 1 times [2024-11-10 14:38:37,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:37,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339086802] [2024-11-10 14:38:37,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:37,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:38,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:38,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:38,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339086802] [2024-11-10 14:38:38,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339086802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:38,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:38,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:38:38,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842245684] [2024-11-10 14:38:38,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:38,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:38:38,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:38,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:38:38,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:38:38,658 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 600 out of 649 [2024-11-10 14:38:38,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 611 transitions, 1824 flow. Second operand has 6 states, 6 states have (on average 603.1666666666666) internal successors, (3619), 6 states have internal predecessors, (3619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:38,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:38,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 600 of 649 [2024-11-10 14:38:38,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:40,007 INFO L124 PetriNetUnfolderBase]: 636/6956 cut-off events. [2024-11-10 14:38:40,007 INFO L125 PetriNetUnfolderBase]: For 2477/2689 co-relation queries the response was YES. [2024-11-10 14:38:40,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10748 conditions, 6956 events. 636/6956 cut-off events. For 2477/2689 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 66524 event pairs, 97 based on Foata normal form. 41/6656 useless extension candidates. Maximal degree in co-relation 10617. Up to 467 conditions per place. [2024-11-10 14:38:40,094 INFO L140 encePairwiseOnDemand]: 641/649 looper letters, 42 selfloop transitions, 6 changer transitions 0/617 dead transitions. [2024-11-10 14:38:40,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 617 transitions, 1940 flow [2024-11-10 14:38:40,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:38:40,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:38:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3644 transitions. [2024-11-10 14:38:40,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357986646122239 [2024-11-10 14:38:40,097 INFO L175 Difference]: Start difference. First operand has 625 places, 611 transitions, 1824 flow. Second operand 6 states and 3644 transitions. [2024-11-10 14:38:40,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 617 transitions, 1940 flow [2024-11-10 14:38:40,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 617 transitions, 1939 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:38:40,114 INFO L231 Difference]: Finished difference. Result has 627 places, 609 transitions, 1831 flow [2024-11-10 14:38:40,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1819, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1831, PETRI_PLACES=627, PETRI_TRANSITIONS=609} [2024-11-10 14:38:40,115 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 23 predicate places. [2024-11-10 14:38:40,115 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 609 transitions, 1831 flow [2024-11-10 14:38:40,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 603.1666666666666) internal successors, (3619), 6 states have internal predecessors, (3619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:40,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:40,116 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:40,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-10 14:38:40,116 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:40,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:40,116 INFO L85 PathProgramCache]: Analyzing trace with hash 166965469, now seen corresponding path program 1 times [2024-11-10 14:38:40,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:40,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530834033] [2024-11-10 14:38:40,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:40,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:40,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:40,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530834033] [2024-11-10 14:38:40,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530834033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:40,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:40,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:40,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303988542] [2024-11-10 14:38:40,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:40,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:40,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:40,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:40,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:40,180 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 649 [2024-11-10 14:38:40,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 609 transitions, 1831 flow. Second operand has 3 states, 3 states have (on average 626.0) internal successors, (1878), 3 states have internal predecessors, (1878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:40,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:40,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 649 [2024-11-10 14:38:40,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:41,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1641] thread3EXIT-->L127-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][432], [910#true, Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), Black: 899#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 661#(= |#race~n2~0| 0), 733#(= |#race~get2~0| 0), 798#true, Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, 916#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), 667#(= |#race~n3~0| 0), Black: 803#(<= ~n2~0 0), Black: 691#true, 774#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), 2#L127-16true, Black: 827#(<= ~n3~0 0), Black: 835#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 828#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 693#(= |#race~get1~0| 0), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 731#true, Black: 852#(<= ~n3~0 0), Black: 853#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 866#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), 892#(= |#race~get3~0| 0), Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 677#(= |#race~count2~0| 0), Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 890#true]) [2024-11-10 14:38:41,896 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is not cut-off event [2024-11-10 14:38:41,896 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is not cut-off event [2024-11-10 14:38:41,896 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is not cut-off event [2024-11-10 14:38:41,896 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is not cut-off event [2024-11-10 14:38:41,910 INFO L124 PetriNetUnfolderBase]: 688/10519 cut-off events. [2024-11-10 14:38:41,910 INFO L125 PetriNetUnfolderBase]: For 2443/2513 co-relation queries the response was YES. [2024-11-10 14:38:42,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15492 conditions, 10519 events. 688/10519 cut-off events. For 2443/2513 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 109918 event pairs, 76 based on Foata normal form. 0/10020 useless extension candidates. Maximal degree in co-relation 15362. Up to 384 conditions per place. [2024-11-10 14:38:42,122 INFO L140 encePairwiseOnDemand]: 647/649 looper letters, 10 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2024-11-10 14:38:42,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 608 transitions, 1851 flow [2024-11-10 14:38:42,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:42,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1881 transitions. [2024-11-10 14:38:42,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9661016949152542 [2024-11-10 14:38:42,124 INFO L175 Difference]: Start difference. First operand has 627 places, 609 transitions, 1831 flow. Second operand 3 states and 1881 transitions. [2024-11-10 14:38:42,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 608 transitions, 1851 flow [2024-11-10 14:38:42,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 608 transitions, 1839 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:38:42,152 INFO L231 Difference]: Finished difference. Result has 623 places, 608 transitions, 1819 flow [2024-11-10 14:38:42,152 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1817, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1819, PETRI_PLACES=623, PETRI_TRANSITIONS=608} [2024-11-10 14:38:42,152 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 19 predicate places. [2024-11-10 14:38:42,153 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 608 transitions, 1819 flow [2024-11-10 14:38:42,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.0) internal successors, (1878), 3 states have internal predecessors, (1878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:42,153 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:42,153 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:42,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-10 14:38:42,153 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:42,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:42,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1703368230, now seen corresponding path program 1 times [2024-11-10 14:38:42,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:42,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408132720] [2024-11-10 14:38:42,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:42,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:42,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:42,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408132720] [2024-11-10 14:38:42,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408132720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:42,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:42,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:42,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091786594] [2024-11-10 14:38:42,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:42,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:42,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:42,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:42,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:42,220 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 649 [2024-11-10 14:38:42,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 608 transitions, 1819 flow. Second operand has 3 states, 3 states have (on average 625.6666666666666) internal successors, (1877), 3 states have internal predecessors, (1877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:42,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:42,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 649 [2024-11-10 14:38:42,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:43,173 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1578] L97-2-->L97-1: Formula: (= |v_thread3Thread1of1ForFork2_#t~nondet26_3| |v_#race~res3~0_6|) InVars {thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_6|} AuxVars[] AssignedVars[#race~res3~0][392], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), Black: 899#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 661#(= |#race~n2~0| 0), 798#true, 733#(= |#race~get2~0| 0), Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, 916#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 667#(= |#race~n3~0| 0), Black: 803#(<= ~n2~0 0), Black: 691#true, 774#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), 319#L97-1true, Black: 827#(<= ~n3~0 0), Black: 835#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 828#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 693#(= |#race~get1~0| 0), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 731#true, 256#L125true, Black: 852#(<= ~n3~0 0), Black: 853#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 866#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), 892#(= |#race~get3~0| 0), Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 677#(= |#race~count2~0| 0), 919#true, Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 890#true]) [2024-11-10 14:38:43,174 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2024-11-10 14:38:43,174 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-10 14:38:43,174 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-10 14:38:43,174 INFO L297 olderBase$Statistics]: existing Event has 396 ancestors and is cut-off event [2024-11-10 14:38:43,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1641] thread3EXIT-->L127-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][432], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), Black: 899#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 661#(= |#race~n2~0| 0), 798#true, 733#(= |#race~get2~0| 0), Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, 916#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 667#(= |#race~n3~0| 0), Black: 803#(<= ~n2~0 0), Black: 691#true, 774#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), 2#L127-16true, Black: 827#(<= ~n3~0 0), Black: 835#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 828#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 693#(= |#race~get1~0| 0), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 731#true, Black: 852#(<= ~n3~0 0), Black: 853#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 866#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), 892#(= |#race~get3~0| 0), Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 677#(= |#race~count2~0| 0), 919#true, Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 890#true]) [2024-11-10 14:38:43,196 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2024-11-10 14:38:43,196 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-10 14:38:43,196 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2024-11-10 14:38:43,196 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-10 14:38:43,197 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1641] thread3EXIT-->L127-16: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][432], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), Black: 899#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 661#(= |#race~n2~0| 0), 733#(= |#race~get2~0| 0), 798#true, Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, 916#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), 667#(= |#race~n3~0| 0), Black: 803#(<= ~n2~0 0), Black: 691#true, 774#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), 2#L127-16true, Black: 827#(<= ~n3~0 0), Black: 835#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 828#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 693#(= |#race~get1~0| 0), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 731#true, Black: 852#(<= ~n3~0 0), Black: 853#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 866#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), 892#(= |#race~get3~0| 0), Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 677#(= |#race~count2~0| 0), 919#true, Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 890#true]) [2024-11-10 14:38:43,197 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is not cut-off event [2024-11-10 14:38:43,197 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is not cut-off event [2024-11-10 14:38:43,197 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is not cut-off event [2024-11-10 14:38:43,197 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is not cut-off event [2024-11-10 14:38:43,197 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is not cut-off event [2024-11-10 14:38:43,202 INFO L124 PetriNetUnfolderBase]: 464/6122 cut-off events. [2024-11-10 14:38:43,202 INFO L125 PetriNetUnfolderBase]: For 1285/1336 co-relation queries the response was YES. [2024-11-10 14:38:43,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8954 conditions, 6122 events. 464/6122 cut-off events. For 1285/1336 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 56615 event pairs, 98 based on Foata normal form. 30/5828 useless extension candidates. Maximal degree in co-relation 8824. Up to 389 conditions per place. [2024-11-10 14:38:43,314 INFO L140 encePairwiseOnDemand]: 647/649 looper letters, 8 selfloop transitions, 0 changer transitions 22/607 dead transitions. [2024-11-10 14:38:43,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 607 transitions, 1837 flow [2024-11-10 14:38:43,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:43,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:43,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1880 transitions. [2024-11-10 14:38:43,316 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.965588084232152 [2024-11-10 14:38:43,316 INFO L175 Difference]: Start difference. First operand has 623 places, 608 transitions, 1819 flow. Second operand 3 states and 1880 transitions. [2024-11-10 14:38:43,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 607 transitions, 1837 flow [2024-11-10 14:38:43,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 607 transitions, 1836 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:38:43,333 INFO L231 Difference]: Finished difference. Result has 623 places, 585 transitions, 1683 flow [2024-11-10 14:38:43,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1816, PETRI_DIFFERENCE_MINUEND_PLACES=621, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1683, PETRI_PLACES=623, PETRI_TRANSITIONS=585} [2024-11-10 14:38:43,335 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 19 predicate places. [2024-11-10 14:38:43,335 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 585 transitions, 1683 flow [2024-11-10 14:38:43,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 625.6666666666666) internal successors, (1877), 3 states have internal predecessors, (1877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:43,336 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:43,336 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:38:43,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-10 14:38:43,336 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:43,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:43,337 INFO L85 PathProgramCache]: Analyzing trace with hash -147104781, now seen corresponding path program 1 times [2024-11-10 14:38:43,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:43,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845835928] [2024-11-10 14:38:43,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:43,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:43,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:43,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845835928] [2024-11-10 14:38:43,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845835928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:43,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:43,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:43,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963648323] [2024-11-10 14:38:43,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:43,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:43,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:43,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:43,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:43,417 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-10 14:38:43,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 623 places, 585 transitions, 1683 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:43,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:43,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-10 14:38:43,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:45,059 INFO L124 PetriNetUnfolderBase]: 625/9660 cut-off events. [2024-11-10 14:38:45,060 INFO L125 PetriNetUnfolderBase]: For 1714/1740 co-relation queries the response was YES. [2024-11-10 14:38:45,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13652 conditions, 9660 events. 625/9660 cut-off events. For 1714/1740 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 96635 event pairs, 53 based on Foata normal form. 0/9232 useless extension candidates. Maximal degree in co-relation 13611. Up to 279 conditions per place. [2024-11-10 14:38:45,242 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 11 selfloop transitions, 2 changer transitions 14/586 dead transitions. [2024-11-10 14:38:45,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 586 transitions, 1713 flow [2024-11-10 14:38:45,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:45,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1877 transitions. [2024-11-10 14:38:45,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9640472521828454 [2024-11-10 14:38:45,244 INFO L175 Difference]: Start difference. First operand has 623 places, 585 transitions, 1683 flow. Second operand 3 states and 1877 transitions. [2024-11-10 14:38:45,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 586 transitions, 1713 flow [2024-11-10 14:38:45,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 586 transitions, 1699 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-11-10 14:38:45,268 INFO L231 Difference]: Finished difference. Result has 610 places, 570 transitions, 1567 flow [2024-11-10 14:38:45,269 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1567, PETRI_PLACES=610, PETRI_TRANSITIONS=570} [2024-11-10 14:38:45,269 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 6 predicate places. [2024-11-10 14:38:45,269 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 570 transitions, 1567 flow [2024-11-10 14:38:45,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:45,270 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:45,270 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:38:45,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-10 14:38:45,270 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:45,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1629029114, now seen corresponding path program 1 times [2024-11-10 14:38:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:45,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748677712] [2024-11-10 14:38:45,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:45,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:45,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:45,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748677712] [2024-11-10 14:38:45,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748677712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:45,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:45,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:45,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952627603] [2024-11-10 14:38:45,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:45,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:45,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:45,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:45,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:45,356 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-10 14:38:45,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 570 transitions, 1567 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:45,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:45,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-10 14:38:45,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:46,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1566] L90-20-->L90-19: Formula: (= |v_#race~get1~0_12| 0) InVars {} OutVars{#race~get1~0=|v_#race~get1~0_12|} AuxVars[] AssignedVars[#race~get1~0][482], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), Black: 899#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 661#(= |#race~n2~0| 0), 798#true, 733#(= |#race~get2~0| 0), 593#L50-19true, Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 667#(= |#race~n3~0| 0), Black: 803#(<= ~n2~0 0), Black: 691#true, 925#true, 774#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 827#(<= ~n3~0 0), Black: 835#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 828#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 353#L122-1true, Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 693#(= |#race~get1~0| 0), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 731#true, 232#L77-1true, Black: 852#(<= ~n3~0 0), Black: 853#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 866#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), 892#(= |#race~get3~0| 0), Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 677#(= |#race~count2~0| 0), 919#true, Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 922#true, Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 890#true, 293#L90-19true]) [2024-11-10 14:38:46,634 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2024-11-10 14:38:46,635 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-10 14:38:46,635 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-10 14:38:46,635 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2024-11-10 14:38:46,711 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1361] L50-12-->L50-11: Formula: (= |v_#race~get2~0_6| 0) InVars {} OutVars{#race~get2~0=|v_#race~get2~0_6|} AuxVars[] AssignedVars[#race~get2~0][469], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), Black: 899#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 661#(= |#race~n2~0| 0), 798#true, 81#L70-19true, 733#(= |#race~get2~0| 0), Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), 667#(= |#race~n3~0| 0), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 803#(<= ~n2~0 0), 925#true, Black: 691#true, 774#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 827#(<= ~n3~0 0), Black: 835#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 828#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 353#L122-1true, Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 693#(= |#race~get1~0| 0), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 731#true, Black: 852#(<= ~n3~0 0), Black: 853#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 866#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), 892#(= |#race~get3~0| 0), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 677#(= |#race~count2~0| 0), 919#true, Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 922#true, Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 890#true, Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 402#L50-11true, 293#L90-19true]) [2024-11-10 14:38:46,712 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2024-11-10 14:38:46,712 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2024-11-10 14:38:46,712 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-10 14:38:46,712 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2024-11-10 14:38:46,729 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1642] thread2EXIT-->L125: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][373], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), Black: 899#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 661#(= |#race~n2~0| 0), 798#true, 733#(= |#race~get2~0| 0), Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 667#(= |#race~n3~0| 0), Black: 803#(<= ~n2~0 0), 925#true, Black: 691#true, 774#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 827#(<= ~n3~0 0), Black: 835#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 828#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 693#(= |#race~get1~0| 0), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 731#true, 256#L125true, Black: 852#(<= ~n3~0 0), Black: 853#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 866#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), 892#(= |#race~get3~0| 0), Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 677#(= |#race~count2~0| 0), 919#true, Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 922#true, Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 890#true, Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 293#L90-19true]) [2024-11-10 14:38:46,729 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is cut-off event [2024-11-10 14:38:46,729 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-10 14:38:46,729 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-10 14:38:46,729 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-10 14:38:46,731 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1465] L77-2-->L77-1: Formula: (= |v_thread2Thread1of1ForFork0_#t~nondet17_3| |v_#race~res2~0_3|) InVars {thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|, #race~res2~0=|v_#race~res2~0_3|} AuxVars[] AssignedVars[#race~res2~0][351], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), Black: 899#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 661#(= |#race~n2~0| 0), 798#true, 733#(= |#race~get2~0| 0), Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 667#(= |#race~n3~0| 0), Black: 803#(<= ~n2~0 0), 925#true, Black: 691#true, 774#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 827#(<= ~n3~0 0), Black: 835#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 841#(and (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|) (<= ~n3~0 0)), Black: 828#(and (= thread2Thread1of1ForFork0_~i~1 0) (<= ~n3~0 0)), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 693#(= |#race~get1~0| 0), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), 566#L124true, Black: 731#true, 232#L77-1true, Black: 852#(<= ~n3~0 0), Black: 853#(and (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), Black: 866#(and (not |thread3Thread1of1ForFork2_#t~short19|) (= thread3Thread1of1ForFork2_~i~2 0) (<= ~n3~0 0)), 892#(= |#race~get3~0| 0), Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 677#(= |#race~count2~0| 0), 919#true, Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 922#true, Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 890#true, Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 293#L90-19true]) [2024-11-10 14:38:46,731 INFO L294 olderBase$Statistics]: this new event has 379 ancestors and is cut-off event [2024-11-10 14:38:46,731 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-10 14:38:46,731 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-10 14:38:46,731 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-10 14:38:46,731 INFO L124 PetriNetUnfolderBase]: 536/7972 cut-off events. [2024-11-10 14:38:46,731 INFO L125 PetriNetUnfolderBase]: For 1223/1263 co-relation queries the response was YES. [2024-11-10 14:38:46,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11159 conditions, 7972 events. 536/7972 cut-off events. For 1223/1263 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 77519 event pairs, 63 based on Foata normal form. 1/7634 useless extension candidates. Maximal degree in co-relation 11117. Up to 233 conditions per place. [2024-11-10 14:38:46,882 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 11 selfloop transitions, 2 changer transitions 13/571 dead transitions. [2024-11-10 14:38:46,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 571 transitions, 1597 flow [2024-11-10 14:38:46,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:46,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:46,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1877 transitions. [2024-11-10 14:38:46,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9640472521828454 [2024-11-10 14:38:46,884 INFO L175 Difference]: Start difference. First operand has 610 places, 570 transitions, 1567 flow. Second operand 3 states and 1877 transitions. [2024-11-10 14:38:46,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 571 transitions, 1597 flow [2024-11-10 14:38:46,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 571 transitions, 1545 flow, removed 16 selfloop flow, removed 13 redundant places. [2024-11-10 14:38:46,903 INFO L231 Difference]: Finished difference. Result has 591 places, 556 transitions, 1432 flow [2024-11-10 14:38:46,903 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1513, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1432, PETRI_PLACES=591, PETRI_TRANSITIONS=556} [2024-11-10 14:38:46,904 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -13 predicate places. [2024-11-10 14:38:46,904 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 556 transitions, 1432 flow [2024-11-10 14:38:46,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:46,904 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:46,905 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-10 14:38:46,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-10 14:38:46,905 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 131 more)] === [2024-11-10 14:38:46,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:46,905 INFO L85 PathProgramCache]: Analyzing trace with hash -834843000, now seen corresponding path program 1 times [2024-11-10 14:38:46,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:46,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636483925] [2024-11-10 14:38:46,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:46,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:46,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:46,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:46,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636483925] [2024-11-10 14:38:46,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636483925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:46,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:46,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:46,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718580051] [2024-11-10 14:38:46,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:46,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:46,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:46,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:46,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:46,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-10 14:38:46,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 556 transitions, 1432 flow. Second operand has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:46,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:46,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-10 14:38:46,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:47,540 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1361] L50-12-->L50-11: Formula: (= |v_#race~get2~0_6| 0) InVars {} OutVars{#race~get2~0=|v_#race~get2~0_6|} AuxVars[] AssignedVars[#race~get2~0][434], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), Black: 899#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 661#(= |#race~n2~0| 0), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 798#true, 81#L70-19true, 733#(= |#race~get2~0| 0), 353#L122-1true, 928#true, Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 693#(= |#race~get1~0| 0), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), Black: 731#true, 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, 892#(= |#race~get3~0| 0), Black: 679#true, Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 681#(= |#race~count3~0| 0), 667#(= |#race~n3~0| 0), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 677#(= |#race~count2~0| 0), 919#true, Black: 803#(<= ~n2~0 0), 925#true, Black: 691#true, 774#true, Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 402#L50-11true, Black: 890#true, 293#L90-19true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|)]) [2024-11-10 14:38:47,540 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2024-11-10 14:38:47,540 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2024-11-10 14:38:47,540 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-10 14:38:47,540 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2024-11-10 14:38:47,559 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1578] L97-2-->L97-1: Formula: (= |v_thread3Thread1of1ForFork2_#t~nondet26_3| |v_#race~res3~0_6|) InVars {thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_6|} AuxVars[] AssignedVars[#race~res3~0][396], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), 319#L97-1true, Black: 899#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 661#(= |#race~n2~0| 0), 733#(= |#race~get2~0| 0), 81#L70-19true, Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 798#true, 928#true, Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 693#(= |#race~get1~0| 0), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), 566#L124true, Black: 779#(<= ~n1~0 0), Black: 731#true, 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, 892#(= |#race~get3~0| 0), Black: 679#true, Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), 681#(= |#race~count3~0| 0), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 667#(= |#race~n3~0| 0), 677#(= |#race~count2~0| 0), 919#true, Black: 803#(<= ~n2~0 0), Black: 691#true, 925#true, 774#true, Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 890#true, Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|)]) [2024-11-10 14:38:47,560 INFO L294 olderBase$Statistics]: this new event has 379 ancestors and is cut-off event [2024-11-10 14:38:47,560 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-10 14:38:47,560 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-10 14:38:47,560 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-10 14:38:47,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1578] L97-2-->L97-1: Formula: (= |v_thread3Thread1of1ForFork2_#t~nondet26_3| |v_#race~res3~0_6|) InVars {thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet26=|v_thread3Thread1of1ForFork2_#t~nondet26_3|, #race~res3~0=|v_#race~res3~0_6|} AuxVars[] AssignedVars[#race~res3~0][396], [Black: 768#(not |thread3Thread1of1ForFork2_#t~short19|), 319#L97-1true, Black: 899#(and (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread3Thread1of1ForFork2_~i~2 4) 2 ~get1~0.offset)) 0)), 661#(= |#race~n2~0| 0), 733#(= |#race~get2~0| 0), Black: 833#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 798#true, 928#true, Black: 719#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 712#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 693#(= |#race~get1~0| 0), Black: 717#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 711#(<= ~n1~0 0), Black: 725#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 780#(and (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 793#(and (not |thread3Thread1of1ForFork2_#t~short19|) (<= ~n1~0 0) (= thread3Thread1of1ForFork2_~i~2 0)), Black: 779#(<= ~n1~0 0), Black: 731#true, 256#L125true, 649#(= |#race~n1~0| 0), 673#(= |#race~count1~0| 0), Black: 671#true, Black: 675#true, 892#(= |#race~get3~0| 0), Black: 679#true, Black: 875#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0)), Black: 688#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 817#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 882#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), 681#(= |#race~count3~0| 0), Black: 804#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 667#(= |#race~n3~0| 0), 677#(= |#race~count2~0| 0), 919#true, Black: 803#(<= ~n2~0 0), 925#true, Black: 691#true, 774#true, Black: 746#(<= ~n2~0 0), Black: 752#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 760#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 747#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 890#true, Black: 754#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 700#(not |thread2Thread1of1ForFork0_#t~short10|)]) [2024-11-10 14:38:47,560 INFO L294 olderBase$Statistics]: this new event has 380 ancestors and is cut-off event [2024-11-10 14:38:47,560 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-10 14:38:47,560 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-10 14:38:47,560 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-10 14:38:47,560 INFO L124 PetriNetUnfolderBase]: 300/3543 cut-off events. [2024-11-10 14:38:47,560 INFO L125 PetriNetUnfolderBase]: For 311/353 co-relation queries the response was YES. [2024-11-10 14:38:47,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4813 conditions, 3543 events. 300/3543 cut-off events. For 311/353 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 27927 event pairs, 62 based on Foata normal form. 1/3379 useless extension candidates. Maximal degree in co-relation 4778. Up to 213 conditions per place. [2024-11-10 14:38:47,625 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 0 selfloop transitions, 0 changer transitions 557/557 dead transitions. [2024-11-10 14:38:47,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 557 transitions, 1462 flow [2024-11-10 14:38:47,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:47,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1877 transitions. [2024-11-10 14:38:47,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9640472521828454 [2024-11-10 14:38:47,627 INFO L175 Difference]: Start difference. First operand has 591 places, 556 transitions, 1432 flow. Second operand 3 states and 1877 transitions. [2024-11-10 14:38:47,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 557 transitions, 1462 flow [2024-11-10 14:38:47,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 557 transitions, 1408 flow, removed 12 selfloop flow, removed 15 redundant places. [2024-11-10 14:38:47,638 INFO L231 Difference]: Finished difference. Result has 570 places, 0 transitions, 0 flow [2024-11-10 14:38:47,638 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=649, PETRI_DIFFERENCE_MINUEND_FLOW=1376, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=570, PETRI_TRANSITIONS=0} [2024-11-10 14:38:47,638 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -34 predicate places. [2024-11-10 14:38:47,639 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 0 transitions, 0 flow [2024-11-10 14:38:47,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:47,645 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (134 of 135 remaining) [2024-11-10 14:38:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (133 of 135 remaining) [2024-11-10 14:38:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (132 of 135 remaining) [2024-11-10 14:38:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (131 of 135 remaining) [2024-11-10 14:38:47,646 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (130 of 135 remaining) [2024-11-10 14:38:47,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (129 of 135 remaining) [2024-11-10 14:38:47,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (128 of 135 remaining) [2024-11-10 14:38:47,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (127 of 135 remaining) [2024-11-10 14:38:47,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (126 of 135 remaining) [2024-11-10 14:38:47,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (125 of 135 remaining) [2024-11-10 14:38:47,647 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (124 of 135 remaining) [2024-11-10 14:38:47,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (123 of 135 remaining) [2024-11-10 14:38:47,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (122 of 135 remaining) [2024-11-10 14:38:47,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (121 of 135 remaining) [2024-11-10 14:38:47,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (120 of 135 remaining) [2024-11-10 14:38:47,648 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (119 of 135 remaining) [2024-11-10 14:38:47,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (118 of 135 remaining) [2024-11-10 14:38:47,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (117 of 135 remaining) [2024-11-10 14:38:47,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (116 of 135 remaining) [2024-11-10 14:38:47,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (115 of 135 remaining) [2024-11-10 14:38:47,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (114 of 135 remaining) [2024-11-10 14:38:47,649 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (113 of 135 remaining) [2024-11-10 14:38:47,652 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (112 of 135 remaining) [2024-11-10 14:38:47,652 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (111 of 135 remaining) [2024-11-10 14:38:47,652 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (110 of 135 remaining) [2024-11-10 14:38:47,652 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (109 of 135 remaining) [2024-11-10 14:38:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (108 of 135 remaining) [2024-11-10 14:38:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (107 of 135 remaining) [2024-11-10 14:38:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (106 of 135 remaining) [2024-11-10 14:38:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (105 of 135 remaining) [2024-11-10 14:38:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (104 of 135 remaining) [2024-11-10 14:38:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (103 of 135 remaining) [2024-11-10 14:38:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (102 of 135 remaining) [2024-11-10 14:38:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (101 of 135 remaining) [2024-11-10 14:38:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (100 of 135 remaining) [2024-11-10 14:38:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (99 of 135 remaining) [2024-11-10 14:38:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (98 of 135 remaining) [2024-11-10 14:38:47,653 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (97 of 135 remaining) [2024-11-10 14:38:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (96 of 135 remaining) [2024-11-10 14:38:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (95 of 135 remaining) [2024-11-10 14:38:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (94 of 135 remaining) [2024-11-10 14:38:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (93 of 135 remaining) [2024-11-10 14:38:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (92 of 135 remaining) [2024-11-10 14:38:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (91 of 135 remaining) [2024-11-10 14:38:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (90 of 135 remaining) [2024-11-10 14:38:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (89 of 135 remaining) [2024-11-10 14:38:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (88 of 135 remaining) [2024-11-10 14:38:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (87 of 135 remaining) [2024-11-10 14:38:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (86 of 135 remaining) [2024-11-10 14:38:47,654 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (85 of 135 remaining) [2024-11-10 14:38:47,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (84 of 135 remaining) [2024-11-10 14:38:47,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (83 of 135 remaining) [2024-11-10 14:38:47,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (82 of 135 remaining) [2024-11-10 14:38:47,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (81 of 135 remaining) [2024-11-10 14:38:47,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (80 of 135 remaining) [2024-11-10 14:38:47,655 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (79 of 135 remaining) [2024-11-10 14:38:47,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (78 of 135 remaining) [2024-11-10 14:38:47,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (77 of 135 remaining) [2024-11-10 14:38:47,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (76 of 135 remaining) [2024-11-10 14:38:47,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (75 of 135 remaining) [2024-11-10 14:38:47,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (74 of 135 remaining) [2024-11-10 14:38:47,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (73 of 135 remaining) [2024-11-10 14:38:47,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (72 of 135 remaining) [2024-11-10 14:38:47,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (71 of 135 remaining) [2024-11-10 14:38:47,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (70 of 135 remaining) [2024-11-10 14:38:47,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (69 of 135 remaining) [2024-11-10 14:38:47,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (68 of 135 remaining) [2024-11-10 14:38:47,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (67 of 135 remaining) [2024-11-10 14:38:47,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (66 of 135 remaining) [2024-11-10 14:38:47,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (65 of 135 remaining) [2024-11-10 14:38:47,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (64 of 135 remaining) [2024-11-10 14:38:47,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (63 of 135 remaining) [2024-11-10 14:38:47,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (62 of 135 remaining) [2024-11-10 14:38:47,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (61 of 135 remaining) [2024-11-10 14:38:47,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (60 of 135 remaining) [2024-11-10 14:38:47,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 135 remaining) [2024-11-10 14:38:47,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 135 remaining) [2024-11-10 14:38:47,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 135 remaining) [2024-11-10 14:38:47,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (56 of 135 remaining) [2024-11-10 14:38:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (55 of 135 remaining) [2024-11-10 14:38:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (54 of 135 remaining) [2024-11-10 14:38:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (53 of 135 remaining) [2024-11-10 14:38:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (52 of 135 remaining) [2024-11-10 14:38:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (51 of 135 remaining) [2024-11-10 14:38:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (50 of 135 remaining) [2024-11-10 14:38:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (49 of 135 remaining) [2024-11-10 14:38:47,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (48 of 135 remaining) [2024-11-10 14:38:47,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (47 of 135 remaining) [2024-11-10 14:38:47,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (46 of 135 remaining) [2024-11-10 14:38:47,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (45 of 135 remaining) [2024-11-10 14:38:47,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (44 of 135 remaining) [2024-11-10 14:38:47,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (43 of 135 remaining) [2024-11-10 14:38:47,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (42 of 135 remaining) [2024-11-10 14:38:47,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 135 remaining) [2024-11-10 14:38:47,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (40 of 135 remaining) [2024-11-10 14:38:47,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (39 of 135 remaining) [2024-11-10 14:38:47,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 135 remaining) [2024-11-10 14:38:47,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (37 of 135 remaining) [2024-11-10 14:38:47,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (36 of 135 remaining) [2024-11-10 14:38:47,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (35 of 135 remaining) [2024-11-10 14:38:47,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (34 of 135 remaining) [2024-11-10 14:38:47,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (33 of 135 remaining) [2024-11-10 14:38:47,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (32 of 135 remaining) [2024-11-10 14:38:47,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (31 of 135 remaining) [2024-11-10 14:38:47,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (30 of 135 remaining) [2024-11-10 14:38:47,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (29 of 135 remaining) [2024-11-10 14:38:47,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (28 of 135 remaining) [2024-11-10 14:38:47,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 135 remaining) [2024-11-10 14:38:47,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (26 of 135 remaining) [2024-11-10 14:38:47,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (25 of 135 remaining) [2024-11-10 14:38:47,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (24 of 135 remaining) [2024-11-10 14:38:47,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (23 of 135 remaining) [2024-11-10 14:38:47,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (22 of 135 remaining) [2024-11-10 14:38:47,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (21 of 135 remaining) [2024-11-10 14:38:47,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 135 remaining) [2024-11-10 14:38:47,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 135 remaining) [2024-11-10 14:38:47,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (18 of 135 remaining) [2024-11-10 14:38:47,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 135 remaining) [2024-11-10 14:38:47,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 135 remaining) [2024-11-10 14:38:47,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (15 of 135 remaining) [2024-11-10 14:38:47,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (14 of 135 remaining) [2024-11-10 14:38:47,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (13 of 135 remaining) [2024-11-10 14:38:47,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 135 remaining) [2024-11-10 14:38:47,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (11 of 135 remaining) [2024-11-10 14:38:47,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (10 of 135 remaining) [2024-11-10 14:38:47,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (9 of 135 remaining) [2024-11-10 14:38:47,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 135 remaining) [2024-11-10 14:38:47,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (7 of 135 remaining) [2024-11-10 14:38:47,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (6 of 135 remaining) [2024-11-10 14:38:47,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 135 remaining) [2024-11-10 14:38:47,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 135 remaining) [2024-11-10 14:38:47,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (3 of 135 remaining) [2024-11-10 14:38:47,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 135 remaining) [2024-11-10 14:38:47,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 135 remaining) [2024-11-10 14:38:47,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (0 of 135 remaining) [2024-11-10 14:38:47,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-10 14:38:47,667 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-10 14:38:47,675 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:38:47,675 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:38:47,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:38:47 BasicIcfg [2024-11-10 14:38:47,682 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:38:47,682 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:38:47,682 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:38:47,683 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:38:47,683 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:37:40" (3/4) ... [2024-11-10 14:38:47,685 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:38:47,688 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:38:47,688 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:38:47,688 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-10 14:38:47,699 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2024-11-10 14:38:47,699 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 14:38:47,700 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:38:47,700 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:38:47,823 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:38:47,823 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:38:47,823 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:38:47,824 INFO L158 Benchmark]: Toolchain (without parser) took 68840.82ms. Allocated memory was 176.2MB in the beginning and 8.3GB in the end (delta: 8.2GB). Free memory was 117.7MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 5.3GB. Max. memory is 16.1GB. [2024-11-10 14:38:47,824 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 176.2MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:38:47,824 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.22ms. Allocated memory is still 176.2MB. Free memory was 117.3MB in the beginning and 101.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 14:38:47,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.99ms. Allocated memory is still 176.2MB. Free memory was 101.2MB in the beginning and 98.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:38:47,825 INFO L158 Benchmark]: Boogie Preprocessor took 44.75ms. Allocated memory is still 176.2MB. Free memory was 98.3MB in the beginning and 95.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:38:47,825 INFO L158 Benchmark]: IcfgBuilder took 1097.16ms. Allocated memory is still 176.2MB. Free memory was 95.4MB in the beginning and 48.1MB in the end (delta: 47.3MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-10 14:38:47,825 INFO L158 Benchmark]: TraceAbstraction took 67057.85ms. Allocated memory was 176.2MB in the beginning and 8.3GB in the end (delta: 8.2GB). Free memory was 141.7MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 5.3GB. Max. memory is 16.1GB. [2024-11-10 14:38:47,825 INFO L158 Benchmark]: Witness Printer took 141.09ms. Allocated memory is still 8.3GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 14:38:47,827 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.21ms. Allocated memory is still 176.2MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.22ms. Allocated memory is still 176.2MB. Free memory was 117.3MB in the beginning and 101.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.99ms. Allocated memory is still 176.2MB. Free memory was 101.2MB in the beginning and 98.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.75ms. Allocated memory is still 176.2MB. Free memory was 98.3MB in the beginning and 95.4MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1097.16ms. Allocated memory is still 176.2MB. Free memory was 95.4MB in the beginning and 48.1MB in the end (delta: 47.3MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 67057.85ms. Allocated memory was 176.2MB in the beginning and 8.3GB in the end (delta: 8.2GB). Free memory was 141.7MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 5.3GB. Max. memory is 16.1GB. * Witness Printer took 141.09ms. Allocated memory is still 8.3GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 944 locations, 135 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: 66.8s, OverallIterations: 46, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 59.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7007 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4389 mSDsluCounter, 7332 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6399 mSDsCounter, 1338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11089 IncrementalHoareTripleChecker+Invalid, 12427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1338 mSolverCounterUnsat, 933 mSDtfsCounter, 11089 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1841occurred in iteration=38, InterpolantAutomatonStates: 209, 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, 5.7s InterpolantComputationTime, 8582 NumberOfCodeBlocks, 8582 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 8536 ConstructedInterpolants, 0 QuantifiedInterpolants, 10674 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 46 InterpolantComputations, 46 PerfectInterpolantSequences, 46/46 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 75 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:38:47,870 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