./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 3289d67d 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-3289d67-m [2024-11-16 23:44:24,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:44:24,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:44:24,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:44:24,606 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:44:24,627 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:44:24,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:44:24,628 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:44:24,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:44:24,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:44:24,631 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:44:24,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:44:24,632 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:44:24,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:44:24,635 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:44:24,636 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:44:24,636 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:44:24,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:44:24,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:44:24,637 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:44:24,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:44:24,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:44:24,637 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:44:24,638 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:44:24,638 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:44:24,638 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:44:24,638 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:44:24,639 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:44:24,639 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:44:24,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:44:24,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:44:24,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:44:24,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:44:24,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:44:24,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:44:24,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:44:24,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:44:24,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:44:24,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:44:24,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:44:24,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:44:24,644 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-16 23:44:24,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:44:24,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:44:24,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:44:24,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:44:24,933 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:44:24,934 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-16 23:44:26,441 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:44:26,649 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:44:26,650 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2024-11-16 23:44:26,662 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/125590195/bfae209c21884dc5b3a9db24abc943df/FLAG4bc5ba6b3 [2024-11-16 23:44:27,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/125590195/bfae209c21884dc5b3a9db24abc943df [2024-11-16 23:44:27,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:44:27,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:44:27,020 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:44:27,020 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:44:27,026 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:44:27,026 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:44:27" (1/1) ... [2024-11-16 23:44:27,027 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce16a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:27, skipping insertion in model container [2024-11-16 23:44:27,027 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:44:27" (1/1) ... [2024-11-16 23:44:27,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:44:27,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:44:27,267 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:44:27,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:44:27,335 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:44:27,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:27 WrapperNode [2024-11-16 23:44:27,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:44:27,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:44:27,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:44:27,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:44:27,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:27" (1/1) ... [2024-11-16 23:44:27,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:27" (1/1) ... [2024-11-16 23:44:27,391 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 241 [2024-11-16 23:44:27,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:44:27,392 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:44:27,392 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:44:27,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:44:27,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:27" (1/1) ... [2024-11-16 23:44:27,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:27" (1/1) ... [2024-11-16 23:44:27,422 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:27" (1/1) ... [2024-11-16 23:44:27,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:27" (1/1) ... [2024-11-16 23:44:27,445 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:27" (1/1) ... [2024-11-16 23:44:27,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:27" (1/1) ... [2024-11-16 23:44:27,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:27" (1/1) ... [2024-11-16 23:44:27,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:27" (1/1) ... [2024-11-16 23:44:27,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:44:27,461 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:44:27,461 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:44:27,461 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:44:27,462 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:27" (1/1) ... [2024-11-16 23:44:27,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:44:27,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:44:27,502 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-16 23:44:27,509 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-16 23:44:27,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:44:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-16 23:44:27,555 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-16 23:44:27,555 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-16 23:44:27,556 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-16 23:44:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-16 23:44:27,556 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-16 23:44:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:44:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:44:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:44:27,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:44:27,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:44:27,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:44:27,558 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:44:27,695 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:44:27,697 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:44:28,605 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:44:28,605 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:44:28,652 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:44:28,655 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:44:28,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:44:28 BoogieIcfgContainer [2024-11-16 23:44:28,656 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:44:28,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:44:28,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:44:28,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:44:28,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:44:27" (1/3) ... [2024-11-16 23:44:28,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff4e1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:44:28, skipping insertion in model container [2024-11-16 23:44:28,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:27" (2/3) ... [2024-11-16 23:44:28,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ff4e1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:44:28, skipping insertion in model container [2024-11-16 23:44:28,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:44:28" (3/3) ... [2024-11-16 23:44:28,667 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2024-11-16 23:44:28,684 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:44:28,684 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 75 error locations. [2024-11-16 23:44:28,685 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:44:28,874 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-16 23:44:28,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 626 places, 649 transitions, 1319 flow [2024-11-16 23:44:29,175 INFO L124 PetriNetUnfolderBase]: 33/646 cut-off events. [2024-11-16 23:44:29,175 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:44:29,196 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-16 23:44:29,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 626 places, 649 transitions, 1319 flow [2024-11-16 23:44:29,212 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 604 places, 625 transitions, 1268 flow [2024-11-16 23:44:29,220 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:44:29,229 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;@6fc99713, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:44:29,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 135 error locations. [2024-11-16 23:44:29,236 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:44:29,236 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-11-16 23:44:29,237 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:44:29,237 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:29,237 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:29,238 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-16 23:44:29,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:29,243 INFO L85 PathProgramCache]: Analyzing trace with hash 682686636, now seen corresponding path program 1 times [2024-11-16 23:44:29,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:29,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224750890] [2024-11-16 23:44:29,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:29,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:29,538 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-16 23:44:29,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:29,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224750890] [2024-11-16 23:44:29,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224750890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:29,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:29,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:29,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953212962] [2024-11-16 23:44:29,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:29,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:29,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:29,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:29,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:29,628 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 649 [2024-11-16 23:44:29,641 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-16 23:44:29,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:29,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 649 [2024-11-16 23:44:29,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:29,931 INFO L124 PetriNetUnfolderBase]: 51/1068 cut-off events. [2024-11-16 23:44:29,931 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-16 23:44:29,949 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-16 23:44:29,963 INFO L140 encePairwiseOnDemand]: 634/649 looper letters, 13 selfloop transitions, 2 changer transitions 6/612 dead transitions. [2024-11-16 23:44:29,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 612 transitions, 1272 flow [2024-11-16 23:44:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1882 transitions. [2024-11-16 23:44:29,987 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9666153055983564 [2024-11-16 23:44:29,989 INFO L175 Difference]: Start difference. First operand has 604 places, 625 transitions, 1268 flow. Second operand 3 states and 1882 transitions. [2024-11-16 23:44:29,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 612 transitions, 1272 flow [2024-11-16 23:44:29,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 612 transitions, 1260 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-16 23:44:30,012 INFO L231 Difference]: Finished difference. Result has 599 places, 606 transitions, 1222 flow [2024-11-16 23:44:30,015 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-16 23:44:30,019 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -5 predicate places. [2024-11-16 23:44:30,020 INFO L471 AbstractCegarLoop]: Abstraction has has 599 places, 606 transitions, 1222 flow [2024-11-16 23:44:30,021 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-16 23:44:30,022 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:30,022 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-16 23:44:30,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:44:30,023 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-16 23:44:30,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:30,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1326665840, now seen corresponding path program 1 times [2024-11-16 23:44:30,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:30,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768072737] [2024-11-16 23:44:30,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:30,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:30,099 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-16 23:44:30,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:30,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768072737] [2024-11-16 23:44:30,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768072737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:30,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:30,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:30,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809094673] [2024-11-16 23:44:30,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:30,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:30,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:30,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:30,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:30,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 649 [2024-11-16 23:44:30,164 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-16 23:44:30,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:30,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 649 [2024-11-16 23:44:30,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:30,553 INFO L124 PetriNetUnfolderBase]: 79/1493 cut-off events. [2024-11-16 23:44:30,554 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 23:44:30,566 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-16 23:44:30,580 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/605 dead transitions. [2024-11-16 23:44:30,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 605 transitions, 1250 flow [2024-11-16 23:44:30,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:30,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:30,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-11-16 23:44:30,587 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96045197740113 [2024-11-16 23:44:30,587 INFO L175 Difference]: Start difference. First operand has 599 places, 606 transitions, 1222 flow. Second operand 3 states and 1870 transitions. [2024-11-16 23:44:30,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 605 transitions, 1250 flow [2024-11-16 23:44:30,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 605 transitions, 1246 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:30,597 INFO L231 Difference]: Finished difference. Result has 592 places, 605 transitions, 1220 flow [2024-11-16 23:44:30,598 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-16 23:44:30,599 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -12 predicate places. [2024-11-16 23:44:30,599 INFO L471 AbstractCegarLoop]: Abstraction has has 592 places, 605 transitions, 1220 flow [2024-11-16 23:44:30,601 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-16 23:44:30,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:30,601 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-16 23:44:30,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:44:30,602 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-16 23:44:30,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:30,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1485039779, now seen corresponding path program 1 times [2024-11-16 23:44:30,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:30,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517640657] [2024-11-16 23:44:30,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:30,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:30,672 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-16 23:44:30,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:30,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517640657] [2024-11-16 23:44:30,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517640657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:30,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:30,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:30,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768847468] [2024-11-16 23:44:30,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:30,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:30,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:30,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:30,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:30,704 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 649 [2024-11-16 23:44:30,707 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-16 23:44:30,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:30,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 649 [2024-11-16 23:44:30,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:31,053 INFO L124 PetriNetUnfolderBase]: 79/1480 cut-off events. [2024-11-16 23:44:31,054 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-11-16 23:44:31,069 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-16 23:44:31,080 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/604 dead transitions. [2024-11-16 23:44:31,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 604 transitions, 1248 flow [2024-11-16 23:44:31,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:31,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-11-16 23:44:31,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96045197740113 [2024-11-16 23:44:31,086 INFO L175 Difference]: Start difference. First operand has 592 places, 605 transitions, 1220 flow. Second operand 3 states and 1870 transitions. [2024-11-16 23:44:31,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 604 transitions, 1248 flow [2024-11-16 23:44:31,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 604 transitions, 1244 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:31,097 INFO L231 Difference]: Finished difference. Result has 591 places, 604 transitions, 1218 flow [2024-11-16 23:44:31,098 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-16 23:44:31,099 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -13 predicate places. [2024-11-16 23:44:31,099 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 604 transitions, 1218 flow [2024-11-16 23:44:31,101 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-16 23:44:31,101 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:31,101 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:31,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:44:31,102 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-16 23:44:31,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:31,103 INFO L85 PathProgramCache]: Analyzing trace with hash 373152624, now seen corresponding path program 1 times [2024-11-16 23:44:31,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:31,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320361980] [2024-11-16 23:44:31,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:31,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:31,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:31,150 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-16 23:44:31,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:31,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320361980] [2024-11-16 23:44:31,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320361980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:31,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:31,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:31,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468860867] [2024-11-16 23:44:31,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:31,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:31,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:31,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:31,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:31,197 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 617 out of 649 [2024-11-16 23:44:31,200 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-16 23:44:31,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:31,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 617 of 649 [2024-11-16 23:44:31,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:31,426 INFO L124 PetriNetUnfolderBase]: 51/1085 cut-off events. [2024-11-16 23:44:31,426 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-16 23:44:31,442 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-16 23:44:31,452 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 14 selfloop transitions, 2 changer transitions 0/603 dead transitions. [2024-11-16 23:44:31,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 603 transitions, 1248 flow [2024-11-16 23:44:31,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:31,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:31,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2024-11-16 23:44:31,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9594247560349255 [2024-11-16 23:44:31,458 INFO L175 Difference]: Start difference. First operand has 591 places, 604 transitions, 1218 flow. Second operand 3 states and 1868 transitions. [2024-11-16 23:44:31,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 603 transitions, 1248 flow [2024-11-16 23:44:31,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 603 transitions, 1244 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:31,470 INFO L231 Difference]: Finished difference. Result has 590 places, 603 transitions, 1216 flow [2024-11-16 23:44:31,471 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-16 23:44:31,471 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -14 predicate places. [2024-11-16 23:44:31,472 INFO L471 AbstractCegarLoop]: Abstraction has has 590 places, 603 transitions, 1216 flow [2024-11-16 23:44:31,473 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-16 23:44:31,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:31,473 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-16 23:44:31,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:44:31,474 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-16 23:44:31,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1229305947, now seen corresponding path program 1 times [2024-11-16 23:44:31,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:31,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496112893] [2024-11-16 23:44:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:31,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:31,548 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-16 23:44:31,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:31,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496112893] [2024-11-16 23:44:31,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496112893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:31,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:31,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:31,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816910131] [2024-11-16 23:44:31,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:31,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:31,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:31,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:31,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:31,589 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 617 out of 649 [2024-11-16 23:44:31,591 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-16 23:44:31,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:31,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 617 of 649 [2024-11-16 23:44:31,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:31,899 INFO L124 PetriNetUnfolderBase]: 89/1780 cut-off events. [2024-11-16 23:44:31,900 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2024-11-16 23:44:31,924 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-16 23:44:31,940 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 14 selfloop transitions, 2 changer transitions 0/602 dead transitions. [2024-11-16 23:44:31,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 602 transitions, 1246 flow [2024-11-16 23:44:31,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:31,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:31,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2024-11-16 23:44:31,945 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9594247560349255 [2024-11-16 23:44:31,945 INFO L175 Difference]: Start difference. First operand has 590 places, 603 transitions, 1216 flow. Second operand 3 states and 1868 transitions. [2024-11-16 23:44:31,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 602 transitions, 1246 flow [2024-11-16 23:44:31,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 602 transitions, 1242 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:31,955 INFO L231 Difference]: Finished difference. Result has 589 places, 602 transitions, 1214 flow [2024-11-16 23:44:31,956 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-16 23:44:31,958 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -15 predicate places. [2024-11-16 23:44:31,959 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 602 transitions, 1214 flow [2024-11-16 23:44:31,960 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-16 23:44:31,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:31,961 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-16 23:44:31,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:44:31,961 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-16 23:44:31,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:31,965 INFO L85 PathProgramCache]: Analyzing trace with hash 480066450, now seen corresponding path program 1 times [2024-11-16 23:44:31,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:31,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610423491] [2024-11-16 23:44:31,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:31,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:32,017 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-16 23:44:32,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:32,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610423491] [2024-11-16 23:44:32,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610423491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:32,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:32,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:32,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129983436] [2024-11-16 23:44:32,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:32,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:32,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:32,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:32,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:32,058 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 617 out of 649 [2024-11-16 23:44:32,061 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-16 23:44:32,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:32,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 617 of 649 [2024-11-16 23:44:32,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:32,216 INFO L124 PetriNetUnfolderBase]: 49/861 cut-off events. [2024-11-16 23:44:32,217 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-16 23:44:32,229 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-16 23:44:32,237 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 14 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2024-11-16 23:44:32,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 601 transitions, 1244 flow [2024-11-16 23:44:32,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:32,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2024-11-16 23:44:32,241 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9594247560349255 [2024-11-16 23:44:32,242 INFO L175 Difference]: Start difference. First operand has 589 places, 602 transitions, 1214 flow. Second operand 3 states and 1868 transitions. [2024-11-16 23:44:32,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 601 transitions, 1244 flow [2024-11-16 23:44:32,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 601 transitions, 1240 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:32,250 INFO L231 Difference]: Finished difference. Result has 588 places, 601 transitions, 1212 flow [2024-11-16 23:44:32,252 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-16 23:44:32,252 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -16 predicate places. [2024-11-16 23:44:32,252 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 601 transitions, 1212 flow [2024-11-16 23:44:32,254 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-16 23:44:32,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:32,255 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:32,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:44:32,255 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-16 23:44:32,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:32,256 INFO L85 PathProgramCache]: Analyzing trace with hash -818209674, now seen corresponding path program 1 times [2024-11-16 23:44:32,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:32,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389385879] [2024-11-16 23:44:32,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:32,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:44:32,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:32,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389385879] [2024-11-16 23:44:32,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389385879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:32,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:32,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:32,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347095094] [2024-11-16 23:44:32,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:32,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:32,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:32,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:32,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:32,326 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 649 [2024-11-16 23:44:32,328 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-16 23:44:32,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:32,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 649 [2024-11-16 23:44:32,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:32,640 INFO L124 PetriNetUnfolderBase]: 102/1566 cut-off events. [2024-11-16 23:44:32,640 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2024-11-16 23:44:32,659 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-16 23:44:32,669 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 16 selfloop transitions, 1 changer transitions 0/596 dead transitions. [2024-11-16 23:44:32,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 596 transitions, 1236 flow [2024-11-16 23:44:32,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-11-16 23:44:32,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9558294812532101 [2024-11-16 23:44:32,673 INFO L175 Difference]: Start difference. First operand has 588 places, 601 transitions, 1212 flow. Second operand 3 states and 1861 transitions. [2024-11-16 23:44:32,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 596 transitions, 1236 flow [2024-11-16 23:44:32,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 596 transitions, 1232 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:32,682 INFO L231 Difference]: Finished difference. Result has 583 places, 596 transitions, 1200 flow [2024-11-16 23:44:32,683 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-16 23:44:32,684 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -21 predicate places. [2024-11-16 23:44:32,684 INFO L471 AbstractCegarLoop]: Abstraction has has 583 places, 596 transitions, 1200 flow [2024-11-16 23:44:32,686 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-16 23:44:32,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:32,686 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-16 23:44:32,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:44:32,686 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-16 23:44:32,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:32,687 INFO L85 PathProgramCache]: Analyzing trace with hash -168160631, now seen corresponding path program 1 times [2024-11-16 23:44:32,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:32,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187218239] [2024-11-16 23:44:32,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:32,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:33,272 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-16 23:44:33,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:33,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187218239] [2024-11-16 23:44:33,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187218239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:33,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:33,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:44:33,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379392019] [2024-11-16 23:44:33,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:33,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:44:33,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:33,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:44:33,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:44:33,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 649 [2024-11-16 23:44:33,729 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-16 23:44:33,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:33,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 649 [2024-11-16 23:44:33,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:41,628 INFO L124 PetriNetUnfolderBase]: 12846/49142 cut-off events. [2024-11-16 23:44:41,628 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-11-16 23:44:41,851 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-16 23:44:42,117 INFO L140 encePairwiseOnDemand]: 631/649 looper letters, 78 selfloop transitions, 15 changer transitions 0/593 dead transitions. [2024-11-16 23:44:42,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 593 transitions, 1380 flow [2024-11-16 23:44:42,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:44:42,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:44:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3330 transitions. [2024-11-16 23:44:42,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8551617873651772 [2024-11-16 23:44:42,124 INFO L175 Difference]: Start difference. First operand has 583 places, 596 transitions, 1200 flow. Second operand 6 states and 3330 transitions. [2024-11-16 23:44:42,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 593 transitions, 1380 flow [2024-11-16 23:44:42,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 593 transitions, 1379 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:44:42,135 INFO L231 Difference]: Finished difference. Result has 584 places, 593 transitions, 1223 flow [2024-11-16 23:44:42,136 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-16 23:44:42,138 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -20 predicate places. [2024-11-16 23:44:42,138 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 593 transitions, 1223 flow [2024-11-16 23:44:42,141 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-16 23:44:42,141 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:42,141 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-16 23:44:42,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:44:42,142 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-16 23:44:42,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:42,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2068406794, now seen corresponding path program 1 times [2024-11-16 23:44:42,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:42,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285314782] [2024-11-16 23:44:42,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:42,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:42,197 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-16 23:44:42,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:42,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285314782] [2024-11-16 23:44:42,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285314782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:42,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:42,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:42,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539180142] [2024-11-16 23:44:42,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:42,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:42,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:42,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:42,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:42,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 649 [2024-11-16 23:44:42,356 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-16 23:44:42,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:42,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 649 [2024-11-16 23:44:42,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:42,533 INFO L124 PetriNetUnfolderBase]: 51/1070 cut-off events. [2024-11-16 23:44:42,534 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-16 23:44:42,547 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-16 23:44:42,554 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/592 dead transitions. [2024-11-16 23:44:42,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 592 transitions, 1251 flow [2024-11-16 23:44:42,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-11-16 23:44:42,559 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96045197740113 [2024-11-16 23:44:42,559 INFO L175 Difference]: Start difference. First operand has 584 places, 593 transitions, 1223 flow. Second operand 3 states and 1870 transitions. [2024-11-16 23:44:42,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 592 transitions, 1251 flow [2024-11-16 23:44:42,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 592 transitions, 1221 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:44:42,568 INFO L231 Difference]: Finished difference. Result has 580 places, 592 transitions, 1195 flow [2024-11-16 23:44:42,569 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-16 23:44:42,570 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -24 predicate places. [2024-11-16 23:44:42,571 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 592 transitions, 1195 flow [2024-11-16 23:44:42,572 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-16 23:44:42,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:42,572 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-16 23:44:42,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:44:42,573 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-16 23:44:42,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash 371533793, now seen corresponding path program 1 times [2024-11-16 23:44:42,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:42,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278131749] [2024-11-16 23:44:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:42,613 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-16 23:44:42,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:42,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278131749] [2024-11-16 23:44:42,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278131749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:42,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:42,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:42,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867104664] [2024-11-16 23:44:42,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:42,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:42,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:42,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:42,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:42,639 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 649 [2024-11-16 23:44:42,641 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-16 23:44:42,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:42,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 649 [2024-11-16 23:44:42,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:43,072 INFO L124 PetriNetUnfolderBase]: 184/2393 cut-off events. [2024-11-16 23:44:43,072 INFO L125 PetriNetUnfolderBase]: For 14/18 co-relation queries the response was YES. [2024-11-16 23:44:43,110 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-16 23:44:43,128 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 16 selfloop transitions, 1 changer transitions 0/587 dead transitions. [2024-11-16 23:44:43,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 587 transitions, 1219 flow [2024-11-16 23:44:43,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:43,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-11-16 23:44:43,133 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9558294812532101 [2024-11-16 23:44:43,133 INFO L175 Difference]: Start difference. First operand has 580 places, 592 transitions, 1195 flow. Second operand 3 states and 1861 transitions. [2024-11-16 23:44:43,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 587 transitions, 1219 flow [2024-11-16 23:44:43,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 587 transitions, 1215 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:43,142 INFO L231 Difference]: Finished difference. Result has 575 places, 587 transitions, 1183 flow [2024-11-16 23:44:43,143 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-16 23:44:43,144 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -29 predicate places. [2024-11-16 23:44:43,145 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 587 transitions, 1183 flow [2024-11-16 23:44:43,146 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-16 23:44:43,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:43,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] [2024-11-16 23:44:43,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:44:43,147 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-16 23:44:43,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:43,147 INFO L85 PathProgramCache]: Analyzing trace with hash 739503324, now seen corresponding path program 1 times [2024-11-16 23:44:43,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:43,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259876933] [2024-11-16 23:44:43,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:43,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:43,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-16 23:44:43,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:43,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259876933] [2024-11-16 23:44:43,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259876933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:43,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:43,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:43,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608884044] [2024-11-16 23:44:43,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:43,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:43,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:43,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:43,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:43,235 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 649 [2024-11-16 23:44:43,238 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-16 23:44:43,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:43,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 649 [2024-11-16 23:44:43,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:43,593 INFO L124 PetriNetUnfolderBase]: 89/1744 cut-off events. [2024-11-16 23:44:43,593 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-16 23:44:43,613 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-16 23:44:43,623 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/586 dead transitions. [2024-11-16 23:44:43,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 586 transitions, 1211 flow [2024-11-16 23:44:43,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-11-16 23:44:43,628 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96045197740113 [2024-11-16 23:44:43,628 INFO L175 Difference]: Start difference. First operand has 575 places, 587 transitions, 1183 flow. Second operand 3 states and 1870 transitions. [2024-11-16 23:44:43,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 586 transitions, 1211 flow [2024-11-16 23:44:43,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 586 transitions, 1210 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:44:43,636 INFO L231 Difference]: Finished difference. Result has 575 places, 586 transitions, 1184 flow [2024-11-16 23:44:43,637 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-16 23:44:43,638 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -29 predicate places. [2024-11-16 23:44:43,638 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 586 transitions, 1184 flow [2024-11-16 23:44:43,640 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-16 23:44:43,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:43,640 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-16 23:44:43,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:44:43,640 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-16 23:44:43,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:43,641 INFO L85 PathProgramCache]: Analyzing trace with hash -158451840, now seen corresponding path program 1 times [2024-11-16 23:44:43,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:43,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497318001] [2024-11-16 23:44:43,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:43,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:43,692 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-16 23:44:43,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:43,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497318001] [2024-11-16 23:44:43,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497318001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:43,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:43,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:43,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297339185] [2024-11-16 23:44:43,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:43,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:43,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:43,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:43,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:43,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 613 out of 649 [2024-11-16 23:44:43,716 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-16 23:44:43,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:43,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 613 of 649 [2024-11-16 23:44:43,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:44,054 INFO L124 PetriNetUnfolderBase]: 167/1869 cut-off events. [2024-11-16 23:44:44,054 INFO L125 PetriNetUnfolderBase]: For 33/35 co-relation queries the response was YES. [2024-11-16 23:44:44,087 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-16 23:44:44,102 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 16 selfloop transitions, 1 changer transitions 0/581 dead transitions. [2024-11-16 23:44:44,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 581 transitions, 1208 flow [2024-11-16 23:44:44,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:44,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:44,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1861 transitions. [2024-11-16 23:44:44,108 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9558294812532101 [2024-11-16 23:44:44,108 INFO L175 Difference]: Start difference. First operand has 575 places, 586 transitions, 1184 flow. Second operand 3 states and 1861 transitions. [2024-11-16 23:44:44,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 581 transitions, 1208 flow [2024-11-16 23:44:44,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 581 transitions, 1204 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:44,117 INFO L231 Difference]: Finished difference. Result has 570 places, 581 transitions, 1172 flow [2024-11-16 23:44:44,120 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-16 23:44:44,121 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -34 predicate places. [2024-11-16 23:44:44,121 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 581 transitions, 1172 flow [2024-11-16 23:44:44,122 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-16 23:44:44,123 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:44,123 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-16 23:44:44,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:44:44,124 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-16 23:44:44,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:44,124 INFO L85 PathProgramCache]: Analyzing trace with hash -380498497, now seen corresponding path program 1 times [2024-11-16 23:44:44,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:44,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051770267] [2024-11-16 23:44:44,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:44,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:44,175 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-16 23:44:44,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:44,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051770267] [2024-11-16 23:44:44,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051770267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:44,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:44,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:44,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313221830] [2024-11-16 23:44:44,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:44,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:44,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:44,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:44,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:44,202 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 649 [2024-11-16 23:44:44,204 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-16 23:44:44,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:44,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 649 [2024-11-16 23:44:44,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:44,403 INFO L124 PetriNetUnfolderBase]: 49/832 cut-off events. [2024-11-16 23:44:44,403 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-16 23:44:44,413 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-16 23:44:44,419 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2024-11-16 23:44:44,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 580 transitions, 1200 flow [2024-11-16 23:44:44,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:44,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1870 transitions. [2024-11-16 23:44:44,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96045197740113 [2024-11-16 23:44:44,425 INFO L175 Difference]: Start difference. First operand has 570 places, 581 transitions, 1172 flow. Second operand 3 states and 1870 transitions. [2024-11-16 23:44:44,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 580 transitions, 1200 flow [2024-11-16 23:44:44,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 580 transitions, 1199 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:44:44,434 INFO L231 Difference]: Finished difference. Result has 570 places, 580 transitions, 1173 flow [2024-11-16 23:44:44,435 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-16 23:44:44,436 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -34 predicate places. [2024-11-16 23:44:44,437 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 580 transitions, 1173 flow [2024-11-16 23:44:44,438 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-16 23:44:44,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:44,438 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-16 23:44:44,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:44:44,439 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-16 23:44:44,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:44,440 INFO L85 PathProgramCache]: Analyzing trace with hash 2086964785, now seen corresponding path program 1 times [2024-11-16 23:44:44,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:44,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395341361] [2024-11-16 23:44:44,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:44,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:44,508 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-16 23:44:44,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:44,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395341361] [2024-11-16 23:44:44,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395341361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:44,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:44,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:44,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856093892] [2024-11-16 23:44:44,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:44,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:44,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:44,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:44,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:44,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 649 [2024-11-16 23:44:44,536 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-16 23:44:44,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:44,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 649 [2024-11-16 23:44:44,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:44,919 INFO L124 PetriNetUnfolderBase]: 96/1557 cut-off events. [2024-11-16 23:44:44,919 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-16 23:44:44,947 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-16 23:44:44,960 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 17 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2024-11-16 23:44:44,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 580 transitions, 1213 flow [2024-11-16 23:44:44,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1871 transitions. [2024-11-16 23:44:44,966 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9609655880842322 [2024-11-16 23:44:44,966 INFO L175 Difference]: Start difference. First operand has 570 places, 580 transitions, 1173 flow. Second operand 3 states and 1871 transitions. [2024-11-16 23:44:44,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 580 transitions, 1213 flow [2024-11-16 23:44:44,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 580 transitions, 1209 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:44,982 INFO L231 Difference]: Finished difference. Result has 567 places, 578 transitions, 1175 flow [2024-11-16 23:44:44,984 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-16 23:44:44,984 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -37 predicate places. [2024-11-16 23:44:44,984 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 578 transitions, 1175 flow [2024-11-16 23:44:44,986 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-16 23:44:44,986 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:44,986 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-16 23:44:44,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:44:44,987 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-16 23:44:44,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:44,987 INFO L85 PathProgramCache]: Analyzing trace with hash -176528174, now seen corresponding path program 1 times [2024-11-16 23:44:44,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:44,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596944024] [2024-11-16 23:44:44,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:44,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:45,064 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-16 23:44:45,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:45,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596944024] [2024-11-16 23:44:45,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596944024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:45,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:45,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:45,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170826211] [2024-11-16 23:44:45,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:45,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:45,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:45,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:45,086 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 649 [2024-11-16 23:44:45,088 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-16 23:44:45,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:45,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 649 [2024-11-16 23:44:45,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:45,574 INFO L124 PetriNetUnfolderBase]: 160/2298 cut-off events. [2024-11-16 23:44:45,575 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 23:44:45,606 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-16 23:44:45,620 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 17 selfloop transitions, 2 changer transitions 0/578 dead transitions. [2024-11-16 23:44:45,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 578 transitions, 1215 flow [2024-11-16 23:44:45,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1871 transitions. [2024-11-16 23:44:45,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9609655880842322 [2024-11-16 23:44:45,626 INFO L175 Difference]: Start difference. First operand has 567 places, 578 transitions, 1175 flow. Second operand 3 states and 1871 transitions. [2024-11-16 23:44:45,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 578 transitions, 1215 flow [2024-11-16 23:44:45,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 578 transitions, 1215 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:44:45,637 INFO L231 Difference]: Finished difference. Result has 566 places, 576 transitions, 1181 flow [2024-11-16 23:44:45,638 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-16 23:44:45,638 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -38 predicate places. [2024-11-16 23:44:45,639 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 576 transitions, 1181 flow [2024-11-16 23:44:45,640 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-16 23:44:45,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:45,641 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-16 23:44:45,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:44:45,641 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-16 23:44:45,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:45,642 INFO L85 PathProgramCache]: Analyzing trace with hash -659668940, now seen corresponding path program 1 times [2024-11-16 23:44:45,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:45,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876195782] [2024-11-16 23:44:45,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:45,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:45,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:44:45,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:45,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876195782] [2024-11-16 23:44:45,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876195782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:45,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:45,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:45,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823215344] [2024-11-16 23:44:45,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:45,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:45,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:45,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:45,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:45,731 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 649 [2024-11-16 23:44:45,734 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-16 23:44:45,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:45,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 649 [2024-11-16 23:44:45,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:46,288 INFO L124 PetriNetUnfolderBase]: 251/3262 cut-off events. [2024-11-16 23:44:46,288 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2024-11-16 23:44:46,313 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-16 23:44:46,325 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 17 selfloop transitions, 2 changer transitions 0/576 dead transitions. [2024-11-16 23:44:46,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 576 transitions, 1221 flow [2024-11-16 23:44:46,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:46,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1871 transitions. [2024-11-16 23:44:46,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9609655880842322 [2024-11-16 23:44:46,330 INFO L175 Difference]: Start difference. First operand has 566 places, 576 transitions, 1181 flow. Second operand 3 states and 1871 transitions. [2024-11-16 23:44:46,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 576 transitions, 1221 flow [2024-11-16 23:44:46,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 576 transitions, 1221 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:44:46,341 INFO L231 Difference]: Finished difference. Result has 565 places, 574 transitions, 1187 flow [2024-11-16 23:44:46,341 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-16 23:44:46,342 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -39 predicate places. [2024-11-16 23:44:46,342 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 574 transitions, 1187 flow [2024-11-16 23:44:46,343 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-16 23:44:46,343 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:46,344 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-16 23:44:46,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:44:46,344 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-16 23:44:46,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:46,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1601769188, now seen corresponding path program 1 times [2024-11-16 23:44:46,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:46,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651264442] [2024-11-16 23:44:46,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:46,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:46,406 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-16 23:44:46,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:46,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651264442] [2024-11-16 23:44:46,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651264442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:46,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:46,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:46,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128790591] [2024-11-16 23:44:46,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:46,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:46,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:46,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:46,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:46,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-16 23:44:46,431 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-16 23:44:46,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:46,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-16 23:44:46,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:46,878 INFO L124 PetriNetUnfolderBase]: 109/2052 cut-off events. [2024-11-16 23:44:46,878 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2024-11-16 23:44:46,902 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-16 23:44:46,910 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2024-11-16 23:44:46,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 575 transitions, 1221 flow [2024-11-16 23:44:46,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:46,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1879 transitions. [2024-11-16 23:44:46,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650744735490498 [2024-11-16 23:44:46,915 INFO L175 Difference]: Start difference. First operand has 565 places, 574 transitions, 1187 flow. Second operand 3 states and 1879 transitions. [2024-11-16 23:44:46,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 575 transitions, 1221 flow [2024-11-16 23:44:46,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 575 transitions, 1221 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:44:46,926 INFO L231 Difference]: Finished difference. Result has 566 places, 573 transitions, 1189 flow [2024-11-16 23:44:46,926 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-16 23:44:46,927 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -38 predicate places. [2024-11-16 23:44:46,927 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 573 transitions, 1189 flow [2024-11-16 23:44:46,928 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-16 23:44:46,928 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:46,928 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-16 23:44:46,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 23:44:46,929 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-16 23:44:46,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:46,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1946788395, now seen corresponding path program 1 times [2024-11-16 23:44:46,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:46,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907044143] [2024-11-16 23:44:46,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:46,998 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-16 23:44:46,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:46,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907044143] [2024-11-16 23:44:46,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907044143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:46,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:46,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:44:47,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180398163] [2024-11-16 23:44:47,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:47,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:47,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:47,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:47,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:47,013 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-16 23:44:47,015 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-16 23:44:47,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:47,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-16 23:44:47,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:47,316 INFO L124 PetriNetUnfolderBase]: 90/1584 cut-off events. [2024-11-16 23:44:47,316 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-16 23:44:47,332 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-16 23:44:47,339 INFO L140 encePairwiseOnDemand]: 645/649 looper letters, 14 selfloop transitions, 3 changer transitions 0/576 dead transitions. [2024-11-16 23:44:47,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 576 transitions, 1231 flow [2024-11-16 23:44:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1881 transitions. [2024-11-16 23:44:47,343 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9661016949152542 [2024-11-16 23:44:47,343 INFO L175 Difference]: Start difference. First operand has 566 places, 573 transitions, 1189 flow. Second operand 3 states and 1881 transitions. [2024-11-16 23:44:47,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 576 transitions, 1231 flow [2024-11-16 23:44:47,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 576 transitions, 1227 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:47,354 INFO L231 Difference]: Finished difference. Result has 568 places, 574 transitions, 1203 flow [2024-11-16 23:44:47,355 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-16 23:44:47,355 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -36 predicate places. [2024-11-16 23:44:47,355 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 574 transitions, 1203 flow [2024-11-16 23:44:47,356 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-16 23:44:47,356 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:47,356 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-16 23:44:47,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 23:44:47,357 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-16 23:44:47,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:47,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1774160570, now seen corresponding path program 1 times [2024-11-16 23:44:47,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:47,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249458088] [2024-11-16 23:44:47,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:47,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:47,421 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-16 23:44:47,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:47,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249458088] [2024-11-16 23:44:47,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249458088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:47,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:47,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:47,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014191591] [2024-11-16 23:44:47,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:47,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:47,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:47,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:47,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:47,442 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 649 [2024-11-16 23:44:47,444 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-16 23:44:47,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:47,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 649 [2024-11-16 23:44:47,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:48,045 INFO L124 PetriNetUnfolderBase]: 198/2671 cut-off events. [2024-11-16 23:44:48,046 INFO L125 PetriNetUnfolderBase]: For 41/43 co-relation queries the response was YES. [2024-11-16 23:44:48,081 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-16 23:44:48,095 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 20 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2024-11-16 23:44:48,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 577 transitions, 1258 flow [2024-11-16 23:44:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1874 transitions. [2024-11-16 23:44:48,099 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9625064201335388 [2024-11-16 23:44:48,099 INFO L175 Difference]: Start difference. First operand has 568 places, 574 transitions, 1203 flow. Second operand 3 states and 1874 transitions. [2024-11-16 23:44:48,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 577 transitions, 1258 flow [2024-11-16 23:44:48,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 564 places, 577 transitions, 1252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:48,111 INFO L231 Difference]: Finished difference. Result has 565 places, 572 transitions, 1203 flow [2024-11-16 23:44:48,111 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-16 23:44:48,112 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -39 predicate places. [2024-11-16 23:44:48,112 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 572 transitions, 1203 flow [2024-11-16 23:44:48,113 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-16 23:44:48,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:48,113 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-16 23:44:48,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 23:44:48,114 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-16 23:44:48,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:48,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1813105643, now seen corresponding path program 1 times [2024-11-16 23:44:48,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:48,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41611212] [2024-11-16 23:44:48,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:48,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:48,174 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-16 23:44:48,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:48,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41611212] [2024-11-16 23:44:48,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41611212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:48,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:48,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:48,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781892933] [2024-11-16 23:44:48,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:48,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:48,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:48,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:48,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:48,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-16 23:44:48,201 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-16 23:44:48,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:48,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-16 23:44:48,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:48,773 INFO L124 PetriNetUnfolderBase]: 184/2916 cut-off events. [2024-11-16 23:44:48,774 INFO L125 PetriNetUnfolderBase]: For 18/69 co-relation queries the response was YES. [2024-11-16 23:44:48,822 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-16 23:44:48,839 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2024-11-16 23:44:48,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 566 places, 573 transitions, 1237 flow [2024-11-16 23:44:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:48,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1879 transitions. [2024-11-16 23:44:48,843 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650744735490498 [2024-11-16 23:44:48,844 INFO L175 Difference]: Start difference. First operand has 565 places, 572 transitions, 1203 flow. Second operand 3 states and 1879 transitions. [2024-11-16 23:44:48,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 566 places, 573 transitions, 1237 flow [2024-11-16 23:44:48,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 573 transitions, 1237 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:44:48,854 INFO L231 Difference]: Finished difference. Result has 566 places, 571 transitions, 1205 flow [2024-11-16 23:44:48,855 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-16 23:44:48,855 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -38 predicate places. [2024-11-16 23:44:48,855 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 571 transitions, 1205 flow [2024-11-16 23:44:48,856 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-16 23:44:48,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:48,857 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-16 23:44:48,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 23:44:48,857 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-16 23:44:48,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:48,857 INFO L85 PathProgramCache]: Analyzing trace with hash 433725869, now seen corresponding path program 1 times [2024-11-16 23:44:48,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:48,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490575266] [2024-11-16 23:44:48,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:48,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:48,919 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-16 23:44:48,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:48,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490575266] [2024-11-16 23:44:48,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490575266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:48,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:48,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:44:48,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239055786] [2024-11-16 23:44:48,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:48,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:48,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:48,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:48,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:48,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-16 23:44:48,934 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-16 23:44:48,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:48,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-16 23:44:48,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:49,374 INFO L124 PetriNetUnfolderBase]: 154/2286 cut-off events. [2024-11-16 23:44:49,374 INFO L125 PetriNetUnfolderBase]: For 21/54 co-relation queries the response was YES. [2024-11-16 23:44:49,406 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-16 23:44:49,420 INFO L140 encePairwiseOnDemand]: 645/649 looper letters, 14 selfloop transitions, 3 changer transitions 0/574 dead transitions. [2024-11-16 23:44:49,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 574 transitions, 1247 flow [2024-11-16 23:44:49,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1881 transitions. [2024-11-16 23:44:49,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9661016949152542 [2024-11-16 23:44:49,425 INFO L175 Difference]: Start difference. First operand has 566 places, 571 transitions, 1205 flow. Second operand 3 states and 1881 transitions. [2024-11-16 23:44:49,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 574 transitions, 1247 flow [2024-11-16 23:44:49,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 574 transitions, 1243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:49,437 INFO L231 Difference]: Finished difference. Result has 568 places, 572 transitions, 1219 flow [2024-11-16 23:44:49,437 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-16 23:44:49,438 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -36 predicate places. [2024-11-16 23:44:49,438 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 572 transitions, 1219 flow [2024-11-16 23:44:49,439 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-16 23:44:49,439 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:49,439 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-16 23:44:49,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 23:44:49,440 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-16 23:44:49,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:49,440 INFO L85 PathProgramCache]: Analyzing trace with hash 112171384, now seen corresponding path program 1 times [2024-11-16 23:44:49,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:49,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929017538] [2024-11-16 23:44:49,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:49,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:49,503 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-16 23:44:49,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:49,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929017538] [2024-11-16 23:44:49,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929017538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:49,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:49,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:49,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957072765] [2024-11-16 23:44:49,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:49,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:49,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:49,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:49,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:49,524 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-16 23:44:49,526 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-16 23:44:49,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:49,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-16 23:44:49,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:50,083 INFO L124 PetriNetUnfolderBase]: 162/2665 cut-off events. [2024-11-16 23:44:50,083 INFO L125 PetriNetUnfolderBase]: For 18/24 co-relation queries the response was YES. [2024-11-16 23:44:50,115 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-16 23:44:50,127 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2024-11-16 23:44:50,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 573 transitions, 1253 flow [2024-11-16 23:44:50,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:50,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1879 transitions. [2024-11-16 23:44:50,130 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650744735490498 [2024-11-16 23:44:50,130 INFO L175 Difference]: Start difference. First operand has 568 places, 572 transitions, 1219 flow. Second operand 3 states and 1879 transitions. [2024-11-16 23:44:50,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 573 transitions, 1253 flow [2024-11-16 23:44:50,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 573 transitions, 1247 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:50,141 INFO L231 Difference]: Finished difference. Result has 567 places, 571 transitions, 1215 flow [2024-11-16 23:44:50,142 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-16 23:44:50,142 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -37 predicate places. [2024-11-16 23:44:50,142 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 571 transitions, 1215 flow [2024-11-16 23:44:50,143 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-16 23:44:50,143 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:50,143 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-16 23:44:50,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 23:44:50,143 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-16 23:44:50,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:50,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1405760692, now seen corresponding path program 1 times [2024-11-16 23:44:50,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:50,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110004584] [2024-11-16 23:44:50,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:50,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:50,446 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-16 23:44:50,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:50,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110004584] [2024-11-16 23:44:50,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110004584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:50,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:50,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 23:44:50,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195780] [2024-11-16 23:44:50,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:50,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 23:44:50,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:50,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 23:44:50,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 23:44:51,006 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 649 [2024-11-16 23:44:51,011 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-16 23:44:51,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:51,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 649 [2024-11-16 23:44:51,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:51,868 INFO L124 PetriNetUnfolderBase]: 253/3853 cut-off events. [2024-11-16 23:44:51,868 INFO L125 PetriNetUnfolderBase]: For 10/23 co-relation queries the response was YES. [2024-11-16 23:44:51,917 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-16 23:44:51,932 INFO L140 encePairwiseOnDemand]: 634/649 looper letters, 70 selfloop transitions, 16 changer transitions 0/610 dead transitions. [2024-11-16 23:44:51,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 610 transitions, 1481 flow [2024-11-16 23:44:51,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 23:44:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-16 23:44:51,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6565 transitions. [2024-11-16 23:44:51,941 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9195965821543634 [2024-11-16 23:44:51,941 INFO L175 Difference]: Start difference. First operand has 567 places, 571 transitions, 1215 flow. Second operand 11 states and 6565 transitions. [2024-11-16 23:44:51,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 610 transitions, 1481 flow [2024-11-16 23:44:51,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 610 transitions, 1477 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:51,949 INFO L231 Difference]: Finished difference. Result has 580 places, 580 transitions, 1295 flow [2024-11-16 23:44:51,949 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-16 23:44:51,950 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -24 predicate places. [2024-11-16 23:44:51,950 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 580 transitions, 1295 flow [2024-11-16 23:44:51,951 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-16 23:44:51,951 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:51,951 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-16 23:44:51,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 23:44:51,951 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-16 23:44:51,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1737988907, now seen corresponding path program 1 times [2024-11-16 23:44:51,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:51,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829457570] [2024-11-16 23:44:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:51,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:51,999 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-16 23:44:51,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:52,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829457570] [2024-11-16 23:44:52,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829457570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:52,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:52,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:52,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323912919] [2024-11-16 23:44:52,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:52,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:52,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:52,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:52,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:52,017 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 649 [2024-11-16 23:44:52,019 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-16 23:44:52,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:52,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 649 [2024-11-16 23:44:52,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:53,020 INFO L124 PetriNetUnfolderBase]: 369/4906 cut-off events. [2024-11-16 23:44:53,020 INFO L125 PetriNetUnfolderBase]: For 37/67 co-relation queries the response was YES. [2024-11-16 23:44:53,104 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-16 23:44:53,129 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 20 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2024-11-16 23:44:53,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 583 transitions, 1350 flow [2024-11-16 23:44:53,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:53,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:53,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1874 transitions. [2024-11-16 23:44:53,133 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9625064201335388 [2024-11-16 23:44:53,133 INFO L175 Difference]: Start difference. First operand has 580 places, 580 transitions, 1295 flow. Second operand 3 states and 1874 transitions. [2024-11-16 23:44:53,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 583 transitions, 1350 flow [2024-11-16 23:44:53,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 577 places, 583 transitions, 1346 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:44:53,143 INFO L231 Difference]: Finished difference. Result has 578 places, 578 transitions, 1297 flow [2024-11-16 23:44:53,143 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-16 23:44:53,144 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -26 predicate places. [2024-11-16 23:44:53,144 INFO L471 AbstractCegarLoop]: Abstraction has has 578 places, 578 transitions, 1297 flow [2024-11-16 23:44:53,145 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-16 23:44:53,145 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:53,145 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-16 23:44:53,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 23:44:53,145 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-16 23:44:53,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:53,146 INFO L85 PathProgramCache]: Analyzing trace with hash -206042402, now seen corresponding path program 1 times [2024-11-16 23:44:53,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:53,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633754446] [2024-11-16 23:44:53,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:53,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:53,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-16 23:44:53,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:53,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633754446] [2024-11-16 23:44:53,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633754446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:53,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:53,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:53,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105663166] [2024-11-16 23:44:53,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:53,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:53,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:53,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:53,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:53,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-16 23:44:53,231 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-16 23:44:53,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:53,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-16 23:44:53,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:53,885 INFO L124 PetriNetUnfolderBase]: 263/3050 cut-off events. [2024-11-16 23:44:53,885 INFO L125 PetriNetUnfolderBase]: For 91/140 co-relation queries the response was YES. [2024-11-16 23:44:53,929 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-16 23:44:53,942 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/579 dead transitions. [2024-11-16 23:44:53,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 579 places, 579 transitions, 1331 flow [2024-11-16 23:44:53,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1879 transitions. [2024-11-16 23:44:53,946 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650744735490498 [2024-11-16 23:44:53,946 INFO L175 Difference]: Start difference. First operand has 578 places, 578 transitions, 1297 flow. Second operand 3 states and 1879 transitions. [2024-11-16 23:44:53,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 579 places, 579 transitions, 1331 flow [2024-11-16 23:44:53,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 579 transitions, 1331 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:44:53,958 INFO L231 Difference]: Finished difference. Result has 579 places, 577 transitions, 1299 flow [2024-11-16 23:44:53,958 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-16 23:44:53,959 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -25 predicate places. [2024-11-16 23:44:53,959 INFO L471 AbstractCegarLoop]: Abstraction has has 579 places, 577 transitions, 1299 flow [2024-11-16 23:44:53,959 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-16 23:44:53,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:53,960 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-16 23:44:53,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 23:44:53,960 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-16 23:44:53,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:53,961 INFO L85 PathProgramCache]: Analyzing trace with hash 362250106, now seen corresponding path program 1 times [2024-11-16 23:44:53,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:53,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569426982] [2024-11-16 23:44:53,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:53,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:54,033 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-16 23:44:54,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:54,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569426982] [2024-11-16 23:44:54,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569426982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:54,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:54,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:54,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28542579] [2024-11-16 23:44:54,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:54,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:54,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:54,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:54,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:54,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-16 23:44:54,059 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-16 23:44:54,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:54,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-16 23:44:54,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:55,258 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-16 23:44:55,258 INFO L294 olderBase$Statistics]: this new event has 322 ancestors and is cut-off event [2024-11-16 23:44:55,258 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-16 23:44:55,258 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-11-16 23:44:55,258 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-11-16 23:44:55,410 INFO L124 PetriNetUnfolderBase]: 442/6413 cut-off events. [2024-11-16 23:44:55,410 INFO L125 PetriNetUnfolderBase]: For 58/116 co-relation queries the response was YES. [2024-11-16 23:44:55,490 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-16 23:44:55,523 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/578 dead transitions. [2024-11-16 23:44:55,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 578 transitions, 1333 flow [2024-11-16 23:44:55,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:55,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1879 transitions. [2024-11-16 23:44:55,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650744735490498 [2024-11-16 23:44:55,529 INFO L175 Difference]: Start difference. First operand has 579 places, 577 transitions, 1299 flow. Second operand 3 states and 1879 transitions. [2024-11-16 23:44:55,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 578 transitions, 1333 flow [2024-11-16 23:44:55,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 578 transitions, 1329 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:55,541 INFO L231 Difference]: Finished difference. Result has 578 places, 576 transitions, 1297 flow [2024-11-16 23:44:55,542 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-16 23:44:55,543 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -26 predicate places. [2024-11-16 23:44:55,543 INFO L471 AbstractCegarLoop]: Abstraction has has 578 places, 576 transitions, 1297 flow [2024-11-16 23:44:55,544 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-16 23:44:55,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:55,544 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-16 23:44:55,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 23:44:55,544 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-16 23:44:55,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:55,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2051712507, now seen corresponding path program 1 times [2024-11-16 23:44:55,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:55,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961436742] [2024-11-16 23:44:55,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:55,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:55,810 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-16 23:44:55,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:55,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961436742] [2024-11-16 23:44:55,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961436742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:55,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:55,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 23:44:55,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701392372] [2024-11-16 23:44:55,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:55,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 23:44:55,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:55,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 23:44:55,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 23:44:56,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 649 [2024-11-16 23:44:56,197 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-16 23:44:56,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:56,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 649 [2024-11-16 23:44:56,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:58,165 INFO L124 PetriNetUnfolderBase]: 701/8599 cut-off events. [2024-11-16 23:44:58,165 INFO L125 PetriNetUnfolderBase]: For 151/268 co-relation queries the response was YES. [2024-11-16 23:44:58,228 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-16 23:44:58,250 INFO L140 encePairwiseOnDemand]: 634/649 looper letters, 66 selfloop transitions, 16 changer transitions 0/606 dead transitions. [2024-11-16 23:44:58,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 606 transitions, 1537 flow [2024-11-16 23:44:58,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 23:44:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-16 23:44:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6556 transitions. [2024-11-16 23:44:58,258 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9183359013867488 [2024-11-16 23:44:58,258 INFO L175 Difference]: Start difference. First operand has 578 places, 576 transitions, 1297 flow. Second operand 11 states and 6556 transitions. [2024-11-16 23:44:58,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 606 transitions, 1537 flow [2024-11-16 23:44:58,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 606 transitions, 1533 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:58,269 INFO L231 Difference]: Finished difference. Result has 591 places, 585 transitions, 1377 flow [2024-11-16 23:44:58,269 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-16 23:44:58,270 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -13 predicate places. [2024-11-16 23:44:58,270 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 585 transitions, 1377 flow [2024-11-16 23:44:58,271 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-16 23:44:58,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:58,272 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-16 23:44:58,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-16 23:44:58,272 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-16 23:44:58,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:58,272 INFO L85 PathProgramCache]: Analyzing trace with hash 249050257, now seen corresponding path program 1 times [2024-11-16 23:44:58,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:58,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309424041] [2024-11-16 23:44:58,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:58,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:58,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:58,322 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-16 23:44:58,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:58,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309424041] [2024-11-16 23:44:58,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309424041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:58,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:58,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:44:58,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869253297] [2024-11-16 23:44:58,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:58,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:58,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:58,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:58,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:58,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-16 23:44:58,335 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-16 23:44:58,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:58,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-16 23:44:58,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:59,386 INFO L124 PetriNetUnfolderBase]: 708/6586 cut-off events. [2024-11-16 23:44:59,386 INFO L125 PetriNetUnfolderBase]: For 366/437 co-relation queries the response was YES. [2024-11-16 23:44:59,464 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-16 23:44:59,486 INFO L140 encePairwiseOnDemand]: 645/649 looper letters, 14 selfloop transitions, 3 changer transitions 0/588 dead transitions. [2024-11-16 23:44:59,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 588 transitions, 1419 flow [2024-11-16 23:44:59,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1881 transitions. [2024-11-16 23:44:59,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9661016949152542 [2024-11-16 23:44:59,489 INFO L175 Difference]: Start difference. First operand has 591 places, 585 transitions, 1377 flow. Second operand 3 states and 1881 transitions. [2024-11-16 23:44:59,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 588 transitions, 1419 flow [2024-11-16 23:44:59,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 588 transitions, 1415 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:44:59,497 INFO L231 Difference]: Finished difference. Result has 594 places, 586 transitions, 1391 flow [2024-11-16 23:44:59,497 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-16 23:44:59,498 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -10 predicate places. [2024-11-16 23:44:59,498 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 586 transitions, 1391 flow [2024-11-16 23:44:59,499 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-16 23:44:59,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:59,499 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-16 23:44:59,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-16 23:44:59,499 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-16 23:44:59,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:59,499 INFO L85 PathProgramCache]: Analyzing trace with hash -515348008, now seen corresponding path program 1 times [2024-11-16 23:44:59,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:59,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369798284] [2024-11-16 23:44:59,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:59,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:59,546 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-16 23:44:59,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:59,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369798284] [2024-11-16 23:44:59,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369798284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:59,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:59,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:59,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108447801] [2024-11-16 23:44:59,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:59,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:59,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:59,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:59,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:59,566 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-16 23:44:59,568 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-16 23:44:59,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:59,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-16 23:44:59,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:00,389 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-16 23:45:00,390 INFO L294 olderBase$Statistics]: this new event has 323 ancestors and is cut-off event [2024-11-16 23:45:00,390 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2024-11-16 23:45:00,390 INFO L297 olderBase$Statistics]: existing Event has 314 ancestors and is cut-off event [2024-11-16 23:45:00,390 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2024-11-16 23:45:00,395 INFO L124 PetriNetUnfolderBase]: 491/5354 cut-off events. [2024-11-16 23:45:00,395 INFO L125 PetriNetUnfolderBase]: For 291/360 co-relation queries the response was YES. [2024-11-16 23:45:00,462 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-16 23:45:00,479 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 13 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2024-11-16 23:45:00,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 587 transitions, 1425 flow [2024-11-16 23:45:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1879 transitions. [2024-11-16 23:45:00,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650744735490498 [2024-11-16 23:45:00,481 INFO L175 Difference]: Start difference. First operand has 594 places, 586 transitions, 1391 flow. Second operand 3 states and 1879 transitions. [2024-11-16 23:45:00,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 587 transitions, 1425 flow [2024-11-16 23:45:00,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 587 transitions, 1419 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:00,491 INFO L231 Difference]: Finished difference. Result has 593 places, 585 transitions, 1387 flow [2024-11-16 23:45:00,492 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-16 23:45:00,493 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -11 predicate places. [2024-11-16 23:45:00,493 INFO L471 AbstractCegarLoop]: Abstraction has has 593 places, 585 transitions, 1387 flow [2024-11-16 23:45:00,493 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-16 23:45:00,494 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:00,494 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-16 23:45:00,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-16 23:45:00,494 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-16 23:45:00,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:00,495 INFO L85 PathProgramCache]: Analyzing trace with hash 615974862, now seen corresponding path program 1 times [2024-11-16 23:45:00,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:00,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212064677] [2024-11-16 23:45:00,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:00,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:00,684 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-16 23:45:00,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:00,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212064677] [2024-11-16 23:45:00,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212064677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:00,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:00,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 23:45:00,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571534525] [2024-11-16 23:45:00,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:00,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 23:45:00,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:00,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 23:45:00,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 23:45:01,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 649 [2024-11-16 23:45:01,115 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-16 23:45:01,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:01,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 649 [2024-11-16 23:45:01,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:02,139 INFO L124 PetriNetUnfolderBase]: 608/5617 cut-off events. [2024-11-16 23:45:02,139 INFO L125 PetriNetUnfolderBase]: For 389/486 co-relation queries the response was YES. [2024-11-16 23:45:02,208 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-16 23:45:02,227 INFO L140 encePairwiseOnDemand]: 632/649 looper letters, 79 selfloop transitions, 19 changer transitions 0/626 dead transitions. [2024-11-16 23:45:02,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 626 transitions, 1713 flow [2024-11-16 23:45:02,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 23:45:02,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-16 23:45:02,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7157 transitions. [2024-11-16 23:45:02,231 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9189779147406266 [2024-11-16 23:45:02,231 INFO L175 Difference]: Start difference. First operand has 593 places, 585 transitions, 1387 flow. Second operand 12 states and 7157 transitions. [2024-11-16 23:45:02,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 626 transitions, 1713 flow [2024-11-16 23:45:02,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 626 transitions, 1709 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:45:02,241 INFO L231 Difference]: Finished difference. Result has 606 places, 590 transitions, 1463 flow [2024-11-16 23:45:02,242 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-16 23:45:02,242 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 2 predicate places. [2024-11-16 23:45:02,242 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 590 transitions, 1463 flow [2024-11-16 23:45:02,243 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-16 23:45:02,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:02,243 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-16 23:45:02,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-16 23:45:02,244 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-16 23:45:02,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:02,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1341461688, now seen corresponding path program 1 times [2024-11-16 23:45:02,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:02,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740319428] [2024-11-16 23:45:02,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:02,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:02,441 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-16 23:45:02,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:02,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740319428] [2024-11-16 23:45:02,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740319428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:02,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:02,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 23:45:02,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274525690] [2024-11-16 23:45:02,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:02,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 23:45:02,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:02,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 23:45:02,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 23:45:02,853 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 649 [2024-11-16 23:45:02,856 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-16 23:45:02,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:02,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 649 [2024-11-16 23:45:02,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:03,825 INFO L124 PetriNetUnfolderBase]: 416/5747 cut-off events. [2024-11-16 23:45:03,825 INFO L125 PetriNetUnfolderBase]: For 317/340 co-relation queries the response was YES. [2024-11-16 23:45:03,893 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-16 23:45:03,910 INFO L140 encePairwiseOnDemand]: 632/649 looper letters, 71 selfloop transitions, 24 changer transitions 0/624 dead transitions. [2024-11-16 23:45:03,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 617 places, 624 transitions, 1769 flow [2024-11-16 23:45:03,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 23:45:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-16 23:45:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7150 transitions. [2024-11-16 23:45:03,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9180790960451978 [2024-11-16 23:45:03,915 INFO L175 Difference]: Start difference. First operand has 606 places, 590 transitions, 1463 flow. Second operand 12 states and 7150 transitions. [2024-11-16 23:45:03,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 617 places, 624 transitions, 1769 flow [2024-11-16 23:45:03,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 624 transitions, 1752 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-16 23:45:03,927 INFO L231 Difference]: Finished difference. Result has 615 places, 599 transitions, 1579 flow [2024-11-16 23:45:03,927 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-16 23:45:03,928 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 11 predicate places. [2024-11-16 23:45:03,928 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 599 transitions, 1579 flow [2024-11-16 23:45:03,929 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-16 23:45:03,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:03,929 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-16 23:45:03,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-16 23:45:03,930 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-16 23:45:03,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:03,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1968521897, now seen corresponding path program 1 times [2024-11-16 23:45:03,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:03,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270883906] [2024-11-16 23:45:03,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:03,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:04,108 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-16 23:45:04,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:04,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270883906] [2024-11-16 23:45:04,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270883906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:04,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:04,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 23:45:04,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503641593] [2024-11-16 23:45:04,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:04,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 23:45:04,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:04,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 23:45:04,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 23:45:04,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 649 [2024-11-16 23:45:04,606 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-16 23:45:04,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:04,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 649 [2024-11-16 23:45:04,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:06,489 INFO L124 PetriNetUnfolderBase]: 940/11028 cut-off events. [2024-11-16 23:45:06,489 INFO L125 PetriNetUnfolderBase]: For 1023/1158 co-relation queries the response was YES. [2024-11-16 23:45:06,644 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-16 23:45:06,685 INFO L140 encePairwiseOnDemand]: 633/649 looper letters, 69 selfloop transitions, 20 changer transitions 0/627 dead transitions. [2024-11-16 23:45:06,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 627 transitions, 1859 flow [2024-11-16 23:45:06,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 23:45:06,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-16 23:45:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6549 transitions. [2024-11-16 23:45:06,688 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9173553719008265 [2024-11-16 23:45:06,689 INFO L175 Difference]: Start difference. First operand has 615 places, 599 transitions, 1579 flow. Second operand 11 states and 6549 transitions. [2024-11-16 23:45:06,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 627 transitions, 1859 flow [2024-11-16 23:45:06,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 627 transitions, 1842 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-16 23:45:06,706 INFO L231 Difference]: Finished difference. Result has 624 places, 612 transitions, 1700 flow [2024-11-16 23:45:06,706 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-16 23:45:06,707 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 20 predicate places. [2024-11-16 23:45:06,707 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 612 transitions, 1700 flow [2024-11-16 23:45:06,708 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-16 23:45:06,708 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:06,708 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-16 23:45:06,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-16 23:45:06,708 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-16 23:45:06,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:06,709 INFO L85 PathProgramCache]: Analyzing trace with hash 504860474, now seen corresponding path program 1 times [2024-11-16 23:45:06,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:06,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134140353] [2024-11-16 23:45:06,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:06,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:06,895 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-16 23:45:06,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:06,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134140353] [2024-11-16 23:45:06,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134140353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:06,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:06,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 23:45:06,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044618655] [2024-11-16 23:45:06,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:06,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 23:45:06,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:06,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 23:45:06,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 23:45:07,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 649 [2024-11-16 23:45:07,311 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-16 23:45:07,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:07,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 649 [2024-11-16 23:45:07,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:08,710 INFO L124 PetriNetUnfolderBase]: 761/7097 cut-off events. [2024-11-16 23:45:08,710 INFO L125 PetriNetUnfolderBase]: For 1388/1508 co-relation queries the response was YES. [2024-11-16 23:45:08,810 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-16 23:45:08,834 INFO L140 encePairwiseOnDemand]: 633/649 looper letters, 70 selfloop transitions, 21 changer transitions 0/636 dead transitions. [2024-11-16 23:45:08,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 634 places, 636 transitions, 1987 flow [2024-11-16 23:45:08,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 23:45:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-16 23:45:08,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6549 transitions. [2024-11-16 23:45:08,838 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9173553719008265 [2024-11-16 23:45:08,838 INFO L175 Difference]: Start difference. First operand has 624 places, 612 transitions, 1700 flow. Second operand 11 states and 6549 transitions. [2024-11-16 23:45:08,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 634 places, 636 transitions, 1987 flow [2024-11-16 23:45:08,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 636 transitions, 1983 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:45:08,858 INFO L231 Difference]: Finished difference. Result has 636 places, 621 transitions, 1829 flow [2024-11-16 23:45:08,858 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-16 23:45:08,859 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 32 predicate places. [2024-11-16 23:45:08,859 INFO L471 AbstractCegarLoop]: Abstraction has has 636 places, 621 transitions, 1829 flow [2024-11-16 23:45:08,859 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-16 23:45:08,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:08,860 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-16 23:45:08,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-16 23:45:08,860 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-16 23:45:08,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:08,860 INFO L85 PathProgramCache]: Analyzing trace with hash -325547756, now seen corresponding path program 1 times [2024-11-16 23:45:08,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:08,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821310191] [2024-11-16 23:45:08,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:08,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:09,323 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-16 23:45:09,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:09,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821310191] [2024-11-16 23:45:09,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821310191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:09,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:09,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:45:09,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674477820] [2024-11-16 23:45:09,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:09,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:45:09,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:09,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:45:09,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:45:09,769 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 600 out of 649 [2024-11-16 23:45:09,770 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-16 23:45:09,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:09,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 600 of 649 [2024-11-16 23:45:09,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:11,441 INFO L124 PetriNetUnfolderBase]: 682/9730 cut-off events. [2024-11-16 23:45:11,441 INFO L125 PetriNetUnfolderBase]: For 2257/2321 co-relation queries the response was YES. [2024-11-16 23:45:11,526 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-16 23:45:11,548 INFO L140 encePairwiseOnDemand]: 641/649 looper letters, 42 selfloop transitions, 6 changer transitions 0/628 dead transitions. [2024-11-16 23:45:11,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 628 transitions, 1951 flow [2024-11-16 23:45:11,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:45:11,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:45:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3644 transitions. [2024-11-16 23:45:11,551 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357986646122239 [2024-11-16 23:45:11,551 INFO L175 Difference]: Start difference. First operand has 636 places, 621 transitions, 1829 flow. Second operand 6 states and 3644 transitions. [2024-11-16 23:45:11,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 628 transitions, 1951 flow [2024-11-16 23:45:11,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 628 transitions, 1930 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-16 23:45:11,583 INFO L231 Difference]: Finished difference. Result has 633 places, 620 transitions, 1827 flow [2024-11-16 23:45:11,584 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-16 23:45:11,584 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 29 predicate places. [2024-11-16 23:45:11,584 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 620 transitions, 1827 flow [2024-11-16 23:45:11,585 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-16 23:45:11,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:11,585 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-16 23:45:11,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-16 23:45:11,585 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-16 23:45:11,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:11,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1474185566, now seen corresponding path program 1 times [2024-11-16 23:45:11,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:11,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573574515] [2024-11-16 23:45:11,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:11,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:12,026 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-16 23:45:12,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:12,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573574515] [2024-11-16 23:45:12,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573574515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:12,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:12,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:45:12,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713204822] [2024-11-16 23:45:12,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:12,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:45:12,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:12,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:45:12,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:45:12,550 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 600 out of 649 [2024-11-16 23:45:12,551 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-16 23:45:12,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:12,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 600 of 649 [2024-11-16 23:45:12,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:14,231 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-16 23:45:14,231 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-11-16 23:45:14,231 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-16 23:45:14,231 INFO L297 olderBase$Statistics]: existing Event has 322 ancestors and is cut-off event [2024-11-16 23:45:14,231 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2024-11-16 23:45:14,245 INFO L124 PetriNetUnfolderBase]: 734/10403 cut-off events. [2024-11-16 23:45:14,246 INFO L125 PetriNetUnfolderBase]: For 2679/2881 co-relation queries the response was YES. [2024-11-16 23:45:14,410 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-16 23:45:14,447 INFO L140 encePairwiseOnDemand]: 641/649 looper letters, 42 selfloop transitions, 6 changer transitions 0/627 dead transitions. [2024-11-16 23:45:14,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 627 transitions, 1949 flow [2024-11-16 23:45:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:45:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:45:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3644 transitions. [2024-11-16 23:45:14,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357986646122239 [2024-11-16 23:45:14,450 INFO L175 Difference]: Start difference. First operand has 633 places, 620 transitions, 1827 flow. Second operand 6 states and 3644 transitions. [2024-11-16 23:45:14,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 627 transitions, 1949 flow [2024-11-16 23:45:14,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 627 transitions, 1936 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-16 23:45:14,478 INFO L231 Difference]: Finished difference. Result has 633 places, 619 transitions, 1833 flow [2024-11-16 23:45:14,479 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-16 23:45:14,480 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 29 predicate places. [2024-11-16 23:45:14,480 INFO L471 AbstractCegarLoop]: Abstraction has has 633 places, 619 transitions, 1833 flow [2024-11-16 23:45:14,480 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-16 23:45:14,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:14,481 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-16 23:45:14,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-16 23:45:14,481 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-16 23:45:14,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:14,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1890468104, now seen corresponding path program 1 times [2024-11-16 23:45:14,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:14,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442033217] [2024-11-16 23:45:14,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:14,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:14,947 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-16 23:45:14,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442033217] [2024-11-16 23:45:14,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442033217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:14,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:14,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:45:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131335898] [2024-11-16 23:45:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:14,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:45:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:14,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:45:14,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:45:15,472 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 600 out of 649 [2024-11-16 23:45:15,474 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-16 23:45:15,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:15,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 600 of 649 [2024-11-16 23:45:15,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:17,027 INFO L124 PetriNetUnfolderBase]: 655/9613 cut-off events. [2024-11-16 23:45:17,027 INFO L125 PetriNetUnfolderBase]: For 2340/2404 co-relation queries the response was YES. [2024-11-16 23:45:17,171 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-16 23:45:17,202 INFO L140 encePairwiseOnDemand]: 641/649 looper letters, 42 selfloop transitions, 6 changer transitions 0/625 dead transitions. [2024-11-16 23:45:17,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 625 transitions, 1949 flow [2024-11-16 23:45:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:45:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:45:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3644 transitions. [2024-11-16 23:45:17,205 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357986646122239 [2024-11-16 23:45:17,205 INFO L175 Difference]: Start difference. First operand has 633 places, 619 transitions, 1833 flow. Second operand 6 states and 3644 transitions. [2024-11-16 23:45:17,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 625 transitions, 1949 flow [2024-11-16 23:45:17,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 632 places, 625 transitions, 1936 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-16 23:45:17,239 INFO L231 Difference]: Finished difference. Result has 632 places, 617 transitions, 1828 flow [2024-11-16 23:45:17,240 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-16 23:45:17,240 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 28 predicate places. [2024-11-16 23:45:17,240 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 617 transitions, 1828 flow [2024-11-16 23:45:17,241 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-16 23:45:17,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:17,242 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-16 23:45:17,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-16 23:45:17,242 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-16 23:45:17,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:17,242 INFO L85 PathProgramCache]: Analyzing trace with hash -646832545, now seen corresponding path program 1 times [2024-11-16 23:45:17,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:17,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779527115] [2024-11-16 23:45:17,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:17,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:17,297 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-16 23:45:17,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:17,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779527115] [2024-11-16 23:45:17,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779527115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:17,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:17,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:17,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064753133] [2024-11-16 23:45:17,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:17,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:17,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:17,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:17,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:17,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 616 out of 649 [2024-11-16 23:45:17,317 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-16 23:45:17,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:17,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 616 of 649 [2024-11-16 23:45:17,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:18,971 INFO L124 PetriNetUnfolderBase]: 774/9780 cut-off events. [2024-11-16 23:45:18,971 INFO L125 PetriNetUnfolderBase]: For 1570/1595 co-relation queries the response was YES. [2024-11-16 23:45:19,128 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-16 23:45:19,163 INFO L140 encePairwiseOnDemand]: 643/649 looper letters, 19 selfloop transitions, 2 changer transitions 0/619 dead transitions. [2024-11-16 23:45:19,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 619 transitions, 1878 flow [2024-11-16 23:45:19,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1873 transitions. [2024-11-16 23:45:19,165 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9619928094504365 [2024-11-16 23:45:19,165 INFO L175 Difference]: Start difference. First operand has 632 places, 617 transitions, 1828 flow. Second operand 3 states and 1873 transitions. [2024-11-16 23:45:19,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 619 transitions, 1878 flow [2024-11-16 23:45:19,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 619 transitions, 1866 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:45:19,183 INFO L231 Difference]: Finished difference. Result has 626 places, 615 transitions, 1822 flow [2024-11-16 23:45:19,183 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-16 23:45:19,184 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 22 predicate places. [2024-11-16 23:45:19,184 INFO L471 AbstractCegarLoop]: Abstraction has has 626 places, 615 transitions, 1822 flow [2024-11-16 23:45:19,184 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-16 23:45:19,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:19,185 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-16 23:45:19,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-16 23:45:19,185 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-16 23:45:19,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2098095615, now seen corresponding path program 1 times [2024-11-16 23:45:19,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:19,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671733106] [2024-11-16 23:45:19,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:19,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:19,608 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-16 23:45:19,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:19,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671733106] [2024-11-16 23:45:19,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671733106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:19,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:19,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:45:19,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329066111] [2024-11-16 23:45:19,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:19,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:45:19,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:19,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:45:19,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:45:20,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 600 out of 649 [2024-11-16 23:45:20,044 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-16 23:45:20,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:20,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 600 of 649 [2024-11-16 23:45:20,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:21,294 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-16 23:45:21,294 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2024-11-16 23:45:21,294 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-16 23:45:21,294 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2024-11-16 23:45:21,294 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-16 23:45:21,297 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-16 23:45:21,297 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2024-11-16 23:45:21,297 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-16 23:45:21,297 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-16 23:45:21,297 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2024-11-16 23:45:21,300 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-16 23:45:21,300 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2024-11-16 23:45:21,300 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-16 23:45:21,300 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-16 23:45:21,300 INFO L297 olderBase$Statistics]: existing Event has 334 ancestors and is cut-off event [2024-11-16 23:45:21,303 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-16 23:45:21,303 INFO L294 olderBase$Statistics]: this new event has 366 ancestors and is cut-off event [2024-11-16 23:45:21,303 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-11-16 23:45:21,303 INFO L297 olderBase$Statistics]: existing Event has 366 ancestors and is cut-off event [2024-11-16 23:45:21,303 INFO L297 olderBase$Statistics]: existing Event has 366 ancestors and is cut-off event [2024-11-16 23:45:21,306 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-16 23:45:21,306 INFO L294 olderBase$Statistics]: this new event has 367 ancestors and is cut-off event [2024-11-16 23:45:21,306 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2024-11-16 23:45:21,306 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2024-11-16 23:45:21,306 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2024-11-16 23:45:21,326 INFO L124 PetriNetUnfolderBase]: 711/7197 cut-off events. [2024-11-16 23:45:21,326 INFO L125 PetriNetUnfolderBase]: For 2404/2640 co-relation queries the response was YES. [2024-11-16 23:45:21,404 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-16 23:45:21,421 INFO L140 encePairwiseOnDemand]: 641/649 looper letters, 42 selfloop transitions, 6 changer transitions 0/622 dead transitions. [2024-11-16 23:45:21,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 629 places, 622 transitions, 1944 flow [2024-11-16 23:45:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:45:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:45:21,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3644 transitions. [2024-11-16 23:45:21,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357986646122239 [2024-11-16 23:45:21,424 INFO L175 Difference]: Start difference. First operand has 626 places, 615 transitions, 1822 flow. Second operand 6 states and 3644 transitions. [2024-11-16 23:45:21,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 629 places, 622 transitions, 1944 flow [2024-11-16 23:45:21,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 622 transitions, 1944 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:45:21,437 INFO L231 Difference]: Finished difference. Result has 630 places, 614 transitions, 1841 flow [2024-11-16 23:45:21,438 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-16 23:45:21,438 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 26 predicate places. [2024-11-16 23:45:21,438 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 614 transitions, 1841 flow [2024-11-16 23:45:21,439 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-16 23:45:21,439 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:21,439 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-16 23:45:21,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-16 23:45:21,439 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-16 23:45:21,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:21,440 INFO L85 PathProgramCache]: Analyzing trace with hash 266706370, now seen corresponding path program 1 times [2024-11-16 23:45:21,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:21,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166351526] [2024-11-16 23:45:21,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:21,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:21,868 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-16 23:45:21,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:21,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166351526] [2024-11-16 23:45:21,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166351526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:21,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:21,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:45:21,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863872258] [2024-11-16 23:45:21,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:21,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:45:21,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:21,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:45:21,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:45:22,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 600 out of 649 [2024-11-16 23:45:22,338 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-16 23:45:22,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:22,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 600 of 649 [2024-11-16 23:45:22,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:24,149 INFO L124 PetriNetUnfolderBase]: 778/10907 cut-off events. [2024-11-16 23:45:24,149 INFO L125 PetriNetUnfolderBase]: For 3037/3244 co-relation queries the response was YES. [2024-11-16 23:45:24,317 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-16 23:45:24,353 INFO L140 encePairwiseOnDemand]: 641/649 looper letters, 42 selfloop transitions, 6 changer transitions 0/620 dead transitions. [2024-11-16 23:45:24,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 620 transitions, 1957 flow [2024-11-16 23:45:24,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:45:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:45:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3644 transitions. [2024-11-16 23:45:24,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357986646122239 [2024-11-16 23:45:24,357 INFO L175 Difference]: Start difference. First operand has 630 places, 614 transitions, 1841 flow. Second operand 6 states and 3644 transitions. [2024-11-16 23:45:24,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 620 transitions, 1957 flow [2024-11-16 23:45:24,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 620 transitions, 1944 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-16 23:45:24,398 INFO L231 Difference]: Finished difference. Result has 629 places, 612 transitions, 1836 flow [2024-11-16 23:45:24,398 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-16 23:45:24,399 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 25 predicate places. [2024-11-16 23:45:24,399 INFO L471 AbstractCegarLoop]: Abstraction has has 629 places, 612 transitions, 1836 flow [2024-11-16 23:45:24,400 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-16 23:45:24,400 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:24,400 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-16 23:45:24,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-16 23:45:24,400 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-16 23:45:24,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:24,401 INFO L85 PathProgramCache]: Analyzing trace with hash -375238124, now seen corresponding path program 1 times [2024-11-16 23:45:24,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:24,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284917894] [2024-11-16 23:45:24,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:24,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:24,449 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-16 23:45:24,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:24,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284917894] [2024-11-16 23:45:24,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284917894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:24,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:24,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:24,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443555955] [2024-11-16 23:45:24,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:24,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:24,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:24,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:24,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:24,463 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 649 [2024-11-16 23:45:24,464 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-16 23:45:24,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:24,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 649 [2024-11-16 23:45:24,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:26,156 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-16 23:45:26,157 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is not cut-off event [2024-11-16 23:45:26,157 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is not cut-off event [2024-11-16 23:45:26,157 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is not cut-off event [2024-11-16 23:45:26,157 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is not cut-off event [2024-11-16 23:45:26,183 INFO L124 PetriNetUnfolderBase]: 683/10538 cut-off events. [2024-11-16 23:45:26,183 INFO L125 PetriNetUnfolderBase]: For 2291/2326 co-relation queries the response was YES. [2024-11-16 23:45:26,345 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-16 23:45:26,375 INFO L140 encePairwiseOnDemand]: 647/649 looper letters, 10 selfloop transitions, 1 changer transitions 0/611 dead transitions. [2024-11-16 23:45:26,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 611 transitions, 1856 flow [2024-11-16 23:45:26,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1881 transitions. [2024-11-16 23:45:26,376 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9661016949152542 [2024-11-16 23:45:26,376 INFO L175 Difference]: Start difference. First operand has 629 places, 612 transitions, 1836 flow. Second operand 3 states and 1881 transitions. [2024-11-16 23:45:26,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 611 transitions, 1856 flow [2024-11-16 23:45:26,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 611 transitions, 1844 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:45:26,402 INFO L231 Difference]: Finished difference. Result has 625 places, 611 transitions, 1824 flow [2024-11-16 23:45:26,403 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-16 23:45:26,403 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 21 predicate places. [2024-11-16 23:45:26,403 INFO L471 AbstractCegarLoop]: Abstraction has has 625 places, 611 transitions, 1824 flow [2024-11-16 23:45:26,403 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-16 23:45:26,403 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:26,404 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-16 23:45:26,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-16 23:45:26,404 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-16 23:45:26,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:26,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1031906277, now seen corresponding path program 1 times [2024-11-16 23:45:26,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:26,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110590878] [2024-11-16 23:45:26,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:26,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:26,843 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-16 23:45:26,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:26,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110590878] [2024-11-16 23:45:26,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110590878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:26,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:26,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:45:26,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101350149] [2024-11-16 23:45:26,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:26,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:45:26,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:26,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:45:26,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:45:27,351 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 600 out of 649 [2024-11-16 23:45:27,354 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-16 23:45:27,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:27,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 600 of 649 [2024-11-16 23:45:27,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:28,616 INFO L124 PetriNetUnfolderBase]: 636/6956 cut-off events. [2024-11-16 23:45:28,616 INFO L125 PetriNetUnfolderBase]: For 2477/2689 co-relation queries the response was YES. [2024-11-16 23:45:28,728 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-16 23:45:28,750 INFO L140 encePairwiseOnDemand]: 641/649 looper letters, 42 selfloop transitions, 6 changer transitions 0/617 dead transitions. [2024-11-16 23:45:28,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 617 transitions, 1940 flow [2024-11-16 23:45:28,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:45:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:45:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3644 transitions. [2024-11-16 23:45:28,753 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9357986646122239 [2024-11-16 23:45:28,753 INFO L175 Difference]: Start difference. First operand has 625 places, 611 transitions, 1824 flow. Second operand 6 states and 3644 transitions. [2024-11-16 23:45:28,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 617 transitions, 1940 flow [2024-11-16 23:45:28,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 617 transitions, 1939 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:45:28,776 INFO L231 Difference]: Finished difference. Result has 627 places, 609 transitions, 1831 flow [2024-11-16 23:45:28,776 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-16 23:45:28,777 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 23 predicate places. [2024-11-16 23:45:28,777 INFO L471 AbstractCegarLoop]: Abstraction has has 627 places, 609 transitions, 1831 flow [2024-11-16 23:45:28,778 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-16 23:45:28,778 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:28,778 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-16 23:45:28,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-16 23:45:28,778 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-16 23:45:28,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:28,778 INFO L85 PathProgramCache]: Analyzing trace with hash 166965469, now seen corresponding path program 1 times [2024-11-16 23:45:28,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:28,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959969960] [2024-11-16 23:45:28,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:28,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:28,827 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-16 23:45:28,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:28,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959969960] [2024-11-16 23:45:28,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959969960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:28,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:28,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:28,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465147133] [2024-11-16 23:45:28,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:28,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:28,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:28,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:28,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:28,845 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 649 [2024-11-16 23:45:28,847 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-16 23:45:28,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:28,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 649 [2024-11-16 23:45:28,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:30,654 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-16 23:45:30,654 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is not cut-off event [2024-11-16 23:45:30,654 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is not cut-off event [2024-11-16 23:45:30,654 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is not cut-off event [2024-11-16 23:45:30,654 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is not cut-off event [2024-11-16 23:45:30,665 INFO L124 PetriNetUnfolderBase]: 688/10519 cut-off events. [2024-11-16 23:45:30,666 INFO L125 PetriNetUnfolderBase]: For 2443/2513 co-relation queries the response was YES. [2024-11-16 23:45:30,764 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-16 23:45:30,785 INFO L140 encePairwiseOnDemand]: 647/649 looper letters, 10 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2024-11-16 23:45:30,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 608 transitions, 1851 flow [2024-11-16 23:45:30,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1881 transitions. [2024-11-16 23:45:30,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9661016949152542 [2024-11-16 23:45:30,787 INFO L175 Difference]: Start difference. First operand has 627 places, 609 transitions, 1831 flow. Second operand 3 states and 1881 transitions. [2024-11-16 23:45:30,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 608 transitions, 1851 flow [2024-11-16 23:45:30,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 608 transitions, 1839 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:45:30,811 INFO L231 Difference]: Finished difference. Result has 623 places, 608 transitions, 1819 flow [2024-11-16 23:45:30,812 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-16 23:45:30,812 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 19 predicate places. [2024-11-16 23:45:30,812 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 608 transitions, 1819 flow [2024-11-16 23:45:30,813 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-16 23:45:30,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:30,813 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-16 23:45:30,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-16 23:45:30,813 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-16 23:45:30,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:30,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1703368230, now seen corresponding path program 1 times [2024-11-16 23:45:30,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:30,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797503644] [2024-11-16 23:45:30,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:30,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:30,859 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-16 23:45:30,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:30,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797503644] [2024-11-16 23:45:30,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797503644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:30,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:30,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:30,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663704158] [2024-11-16 23:45:30,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:30,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:30,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:30,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:30,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:30,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 649 [2024-11-16 23:45:30,874 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-16 23:45:30,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:30,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 649 [2024-11-16 23:45:30,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:31,824 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-16 23:45:31,824 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2024-11-16 23:45:31,824 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-16 23:45:31,824 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-16 23:45:31,824 INFO L297 olderBase$Statistics]: existing Event has 396 ancestors and is cut-off event [2024-11-16 23:45:31,845 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-16 23:45:31,845 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2024-11-16 23:45:31,845 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-16 23:45:31,845 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is cut-off event [2024-11-16 23:45:31,845 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-16 23:45:31,846 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-16 23:45:31,846 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is not cut-off event [2024-11-16 23:45:31,846 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is not cut-off event [2024-11-16 23:45:31,846 INFO L297 olderBase$Statistics]: existing Event has 392 ancestors and is not cut-off event [2024-11-16 23:45:31,846 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is not cut-off event [2024-11-16 23:45:31,846 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is not cut-off event [2024-11-16 23:45:31,851 INFO L124 PetriNetUnfolderBase]: 464/6122 cut-off events. [2024-11-16 23:45:31,851 INFO L125 PetriNetUnfolderBase]: For 1285/1336 co-relation queries the response was YES. [2024-11-16 23:45:31,944 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-16 23:45:31,958 INFO L140 encePairwiseOnDemand]: 647/649 looper letters, 8 selfloop transitions, 0 changer transitions 22/607 dead transitions. [2024-11-16 23:45:31,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 607 transitions, 1837 flow [2024-11-16 23:45:31,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:31,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1880 transitions. [2024-11-16 23:45:31,960 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.965588084232152 [2024-11-16 23:45:31,960 INFO L175 Difference]: Start difference. First operand has 623 places, 608 transitions, 1819 flow. Second operand 3 states and 1880 transitions. [2024-11-16 23:45:31,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 607 transitions, 1837 flow [2024-11-16 23:45:31,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 607 transitions, 1836 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:45:31,976 INFO L231 Difference]: Finished difference. Result has 623 places, 585 transitions, 1683 flow [2024-11-16 23:45:31,977 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-16 23:45:31,978 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 19 predicate places. [2024-11-16 23:45:31,978 INFO L471 AbstractCegarLoop]: Abstraction has has 623 places, 585 transitions, 1683 flow [2024-11-16 23:45:31,978 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-16 23:45:31,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:31,979 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-16 23:45:31,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-16 23:45:31,979 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-16 23:45:31,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:31,980 INFO L85 PathProgramCache]: Analyzing trace with hash -147104781, now seen corresponding path program 1 times [2024-11-16 23:45:31,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:31,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534861272] [2024-11-16 23:45:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:31,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:32,042 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-16 23:45:32,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:32,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534861272] [2024-11-16 23:45:32,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534861272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:32,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:32,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:32,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228578544] [2024-11-16 23:45:32,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:32,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:32,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:32,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:32,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:32,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-16 23:45:32,061 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-16 23:45:32,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:32,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-16 23:45:32,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:33,624 INFO L124 PetriNetUnfolderBase]: 625/9660 cut-off events. [2024-11-16 23:45:33,624 INFO L125 PetriNetUnfolderBase]: For 1714/1740 co-relation queries the response was YES. [2024-11-16 23:45:33,758 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-16 23:45:33,779 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 11 selfloop transitions, 2 changer transitions 14/586 dead transitions. [2024-11-16 23:45:33,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 586 transitions, 1713 flow [2024-11-16 23:45:33,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1877 transitions. [2024-11-16 23:45:33,780 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9640472521828454 [2024-11-16 23:45:33,781 INFO L175 Difference]: Start difference. First operand has 623 places, 585 transitions, 1683 flow. Second operand 3 states and 1877 transitions. [2024-11-16 23:45:33,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 586 transitions, 1713 flow [2024-11-16 23:45:33,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 586 transitions, 1699 flow, removed 7 selfloop flow, removed 0 redundant places. [2024-11-16 23:45:33,803 INFO L231 Difference]: Finished difference. Result has 610 places, 570 transitions, 1567 flow [2024-11-16 23:45:33,804 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-16 23:45:33,804 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, 6 predicate places. [2024-11-16 23:45:33,804 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 570 transitions, 1567 flow [2024-11-16 23:45:33,805 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-16 23:45:33,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:33,805 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-16 23:45:33,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-16 23:45:33,805 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-16 23:45:33,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:33,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1629029114, now seen corresponding path program 1 times [2024-11-16 23:45:33,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:33,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252563684] [2024-11-16 23:45:33,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:33,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:33,867 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-16 23:45:33,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:33,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252563684] [2024-11-16 23:45:33,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252563684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:33,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:33,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:33,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430096640] [2024-11-16 23:45:33,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:33,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:33,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:33,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:33,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:33,887 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-16 23:45:33,888 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-16 23:45:33,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:33,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-16 23:45:33,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:35,083 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-16 23:45:35,084 INFO L294 olderBase$Statistics]: this new event has 361 ancestors and is cut-off event [2024-11-16 23:45:35,084 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-16 23:45:35,084 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-16 23:45:35,084 INFO L297 olderBase$Statistics]: existing Event has 330 ancestors and is cut-off event [2024-11-16 23:45:35,160 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-16 23:45:35,161 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2024-11-16 23:45:35,161 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2024-11-16 23:45:35,161 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-16 23:45:35,161 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2024-11-16 23:45:35,177 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-16 23:45:35,177 INFO L294 olderBase$Statistics]: this new event has 375 ancestors and is cut-off event [2024-11-16 23:45:35,177 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-16 23:45:35,177 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-16 23:45:35,178 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-11-16 23:45:35,179 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-16 23:45:35,179 INFO L294 olderBase$Statistics]: this new event has 379 ancestors and is cut-off event [2024-11-16 23:45:35,179 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-16 23:45:35,179 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-16 23:45:35,179 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-16 23:45:35,179 INFO L124 PetriNetUnfolderBase]: 536/7972 cut-off events. [2024-11-16 23:45:35,179 INFO L125 PetriNetUnfolderBase]: For 1223/1263 co-relation queries the response was YES. [2024-11-16 23:45:35,315 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-16 23:45:35,333 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 11 selfloop transitions, 2 changer transitions 13/571 dead transitions. [2024-11-16 23:45:35,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 571 transitions, 1597 flow [2024-11-16 23:45:35,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1877 transitions. [2024-11-16 23:45:35,335 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9640472521828454 [2024-11-16 23:45:35,335 INFO L175 Difference]: Start difference. First operand has 610 places, 570 transitions, 1567 flow. Second operand 3 states and 1877 transitions. [2024-11-16 23:45:35,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 571 transitions, 1597 flow [2024-11-16 23:45:35,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 571 transitions, 1545 flow, removed 16 selfloop flow, removed 13 redundant places. [2024-11-16 23:45:35,353 INFO L231 Difference]: Finished difference. Result has 591 places, 556 transitions, 1432 flow [2024-11-16 23:45:35,353 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-16 23:45:35,353 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -13 predicate places. [2024-11-16 23:45:35,354 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 556 transitions, 1432 flow [2024-11-16 23:45:35,354 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-16 23:45:35,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:45:35,354 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-16 23:45:35,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-16 23:45:35,354 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-16 23:45:35,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:45:35,355 INFO L85 PathProgramCache]: Analyzing trace with hash -834843000, now seen corresponding path program 1 times [2024-11-16 23:45:35,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:45:35,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289937888] [2024-11-16 23:45:35,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:45:35,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:45:35,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:45:35,418 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-16 23:45:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:45:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289937888] [2024-11-16 23:45:35,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289937888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:45:35,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:45:35,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:45:35,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115671435] [2024-11-16 23:45:35,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:45:35,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:45:35,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:45:35,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:45:35,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:45:35,434 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 649 [2024-11-16 23:45:35,434 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-16 23:45:35,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:45:35,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 649 [2024-11-16 23:45:35,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:45:35,992 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-16 23:45:35,992 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2024-11-16 23:45:35,992 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2024-11-16 23:45:35,992 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-16 23:45:35,992 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2024-11-16 23:45:36,015 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-16 23:45:36,015 INFO L294 olderBase$Statistics]: this new event has 379 ancestors and is cut-off event [2024-11-16 23:45:36,015 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-16 23:45:36,015 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-16 23:45:36,015 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-16 23:45:36,015 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-16 23:45:36,016 INFO L294 olderBase$Statistics]: this new event has 380 ancestors and is cut-off event [2024-11-16 23:45:36,016 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-16 23:45:36,016 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-16 23:45:36,016 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-16 23:45:36,016 INFO L124 PetriNetUnfolderBase]: 300/3543 cut-off events. [2024-11-16 23:45:36,016 INFO L125 PetriNetUnfolderBase]: For 311/353 co-relation queries the response was YES. [2024-11-16 23:45:36,074 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-16 23:45:36,076 INFO L140 encePairwiseOnDemand]: 646/649 looper letters, 0 selfloop transitions, 0 changer transitions 557/557 dead transitions. [2024-11-16 23:45:36,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 557 transitions, 1462 flow [2024-11-16 23:45:36,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:45:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:45:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1877 transitions. [2024-11-16 23:45:36,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9640472521828454 [2024-11-16 23:45:36,078 INFO L175 Difference]: Start difference. First operand has 591 places, 556 transitions, 1432 flow. Second operand 3 states and 1877 transitions. [2024-11-16 23:45:36,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 557 transitions, 1462 flow [2024-11-16 23:45:36,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 557 transitions, 1408 flow, removed 12 selfloop flow, removed 15 redundant places. [2024-11-16 23:45:36,087 INFO L231 Difference]: Finished difference. Result has 570 places, 0 transitions, 0 flow [2024-11-16 23:45:36,087 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-16 23:45:36,087 INFO L277 CegarLoopForPetriNet]: 604 programPoint places, -34 predicate places. [2024-11-16 23:45:36,087 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 0 transitions, 0 flow [2024-11-16 23:45:36,088 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-16 23:45:36,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (134 of 135 remaining) [2024-11-16 23:45:36,091 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (133 of 135 remaining) [2024-11-16 23:45:36,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (132 of 135 remaining) [2024-11-16 23:45:36,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (131 of 135 remaining) [2024-11-16 23:45:36,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (130 of 135 remaining) [2024-11-16 23:45:36,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (129 of 135 remaining) [2024-11-16 23:45:36,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (128 of 135 remaining) [2024-11-16 23:45:36,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (127 of 135 remaining) [2024-11-16 23:45:36,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (126 of 135 remaining) [2024-11-16 23:45:36,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (125 of 135 remaining) [2024-11-16 23:45:36,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (124 of 135 remaining) [2024-11-16 23:45:36,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (123 of 135 remaining) [2024-11-16 23:45:36,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (122 of 135 remaining) [2024-11-16 23:45:36,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (121 of 135 remaining) [2024-11-16 23:45:36,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (120 of 135 remaining) [2024-11-16 23:45:36,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (119 of 135 remaining) [2024-11-16 23:45:36,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (118 of 135 remaining) [2024-11-16 23:45:36,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (117 of 135 remaining) [2024-11-16 23:45:36,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (116 of 135 remaining) [2024-11-16 23:45:36,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (115 of 135 remaining) [2024-11-16 23:45:36,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (114 of 135 remaining) [2024-11-16 23:45:36,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (113 of 135 remaining) [2024-11-16 23:45:36,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (112 of 135 remaining) [2024-11-16 23:45:36,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (111 of 135 remaining) [2024-11-16 23:45:36,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (110 of 135 remaining) [2024-11-16 23:45:36,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (109 of 135 remaining) [2024-11-16 23:45:36,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (108 of 135 remaining) [2024-11-16 23:45:36,095 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (107 of 135 remaining) [2024-11-16 23:45:36,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (106 of 135 remaining) [2024-11-16 23:45:36,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (105 of 135 remaining) [2024-11-16 23:45:36,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (104 of 135 remaining) [2024-11-16 23:45:36,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (103 of 135 remaining) [2024-11-16 23:45:36,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (102 of 135 remaining) [2024-11-16 23:45:36,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (101 of 135 remaining) [2024-11-16 23:45:36,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (100 of 135 remaining) [2024-11-16 23:45:36,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (99 of 135 remaining) [2024-11-16 23:45:36,096 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (98 of 135 remaining) [2024-11-16 23:45:36,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (97 of 135 remaining) [2024-11-16 23:45:36,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (96 of 135 remaining) [2024-11-16 23:45:36,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (95 of 135 remaining) [2024-11-16 23:45:36,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (94 of 135 remaining) [2024-11-16 23:45:36,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (93 of 135 remaining) [2024-11-16 23:45:36,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (92 of 135 remaining) [2024-11-16 23:45:36,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (91 of 135 remaining) [2024-11-16 23:45:36,097 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (90 of 135 remaining) [2024-11-16 23:45:36,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (89 of 135 remaining) [2024-11-16 23:45:36,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (88 of 135 remaining) [2024-11-16 23:45:36,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (87 of 135 remaining) [2024-11-16 23:45:36,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (86 of 135 remaining) [2024-11-16 23:45:36,098 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (85 of 135 remaining) [2024-11-16 23:45:36,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (84 of 135 remaining) [2024-11-16 23:45:36,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (83 of 135 remaining) [2024-11-16 23:45:36,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (82 of 135 remaining) [2024-11-16 23:45:36,099 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (81 of 135 remaining) [2024-11-16 23:45:36,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (80 of 135 remaining) [2024-11-16 23:45:36,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (79 of 135 remaining) [2024-11-16 23:45:36,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (78 of 135 remaining) [2024-11-16 23:45:36,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (77 of 135 remaining) [2024-11-16 23:45:36,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (76 of 135 remaining) [2024-11-16 23:45:36,100 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (75 of 135 remaining) [2024-11-16 23:45:36,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (74 of 135 remaining) [2024-11-16 23:45:36,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (73 of 135 remaining) [2024-11-16 23:45:36,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (72 of 135 remaining) [2024-11-16 23:45:36,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (71 of 135 remaining) [2024-11-16 23:45:36,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (70 of 135 remaining) [2024-11-16 23:45:36,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (69 of 135 remaining) [2024-11-16 23:45:36,101 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (68 of 135 remaining) [2024-11-16 23:45:36,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (67 of 135 remaining) [2024-11-16 23:45:36,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (66 of 135 remaining) [2024-11-16 23:45:36,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (65 of 135 remaining) [2024-11-16 23:45:36,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (64 of 135 remaining) [2024-11-16 23:45:36,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (63 of 135 remaining) [2024-11-16 23:45:36,102 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (62 of 135 remaining) [2024-11-16 23:45:36,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (61 of 135 remaining) [2024-11-16 23:45:36,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (60 of 135 remaining) [2024-11-16 23:45:36,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (59 of 135 remaining) [2024-11-16 23:45:36,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (58 of 135 remaining) [2024-11-16 23:45:36,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 135 remaining) [2024-11-16 23:45:36,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (56 of 135 remaining) [2024-11-16 23:45:36,103 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (55 of 135 remaining) [2024-11-16 23:45:36,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (54 of 135 remaining) [2024-11-16 23:45:36,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (53 of 135 remaining) [2024-11-16 23:45:36,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (52 of 135 remaining) [2024-11-16 23:45:36,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (51 of 135 remaining) [2024-11-16 23:45:36,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (50 of 135 remaining) [2024-11-16 23:45:36,104 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (49 of 135 remaining) [2024-11-16 23:45:36,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (48 of 135 remaining) [2024-11-16 23:45:36,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (47 of 135 remaining) [2024-11-16 23:45:36,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (46 of 135 remaining) [2024-11-16 23:45:36,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (45 of 135 remaining) [2024-11-16 23:45:36,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (44 of 135 remaining) [2024-11-16 23:45:36,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (43 of 135 remaining) [2024-11-16 23:45:36,105 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (42 of 135 remaining) [2024-11-16 23:45:36,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (41 of 135 remaining) [2024-11-16 23:45:36,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (40 of 135 remaining) [2024-11-16 23:45:36,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (39 of 135 remaining) [2024-11-16 23:45:36,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (38 of 135 remaining) [2024-11-16 23:45:36,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (37 of 135 remaining) [2024-11-16 23:45:36,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (36 of 135 remaining) [2024-11-16 23:45:36,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (35 of 135 remaining) [2024-11-16 23:45:36,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (34 of 135 remaining) [2024-11-16 23:45:36,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (33 of 135 remaining) [2024-11-16 23:45:36,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (32 of 135 remaining) [2024-11-16 23:45:36,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (31 of 135 remaining) [2024-11-16 23:45:36,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (30 of 135 remaining) [2024-11-16 23:45:36,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (29 of 135 remaining) [2024-11-16 23:45:36,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (28 of 135 remaining) [2024-11-16 23:45:36,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (27 of 135 remaining) [2024-11-16 23:45:36,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (26 of 135 remaining) [2024-11-16 23:45:36,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (25 of 135 remaining) [2024-11-16 23:45:36,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (24 of 135 remaining) [2024-11-16 23:45:36,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (23 of 135 remaining) [2024-11-16 23:45:36,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (22 of 135 remaining) [2024-11-16 23:45:36,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (21 of 135 remaining) [2024-11-16 23:45:36,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 135 remaining) [2024-11-16 23:45:36,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 135 remaining) [2024-11-16 23:45:36,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (18 of 135 remaining) [2024-11-16 23:45:36,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (17 of 135 remaining) [2024-11-16 23:45:36,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (16 of 135 remaining) [2024-11-16 23:45:36,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (15 of 135 remaining) [2024-11-16 23:45:36,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (14 of 135 remaining) [2024-11-16 23:45:36,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (13 of 135 remaining) [2024-11-16 23:45:36,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 135 remaining) [2024-11-16 23:45:36,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (11 of 135 remaining) [2024-11-16 23:45:36,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (10 of 135 remaining) [2024-11-16 23:45:36,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (9 of 135 remaining) [2024-11-16 23:45:36,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 135 remaining) [2024-11-16 23:45:36,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (7 of 135 remaining) [2024-11-16 23:45:36,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (6 of 135 remaining) [2024-11-16 23:45:36,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (5 of 135 remaining) [2024-11-16 23:45:36,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 135 remaining) [2024-11-16 23:45:36,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (3 of 135 remaining) [2024-11-16 23:45:36,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 135 remaining) [2024-11-16 23:45:36,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 135 remaining) [2024-11-16 23:45:36,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (0 of 135 remaining) [2024-11-16 23:45:36,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-16 23:45:36,111 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-16 23:45:36,118 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 23:45:36,119 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 23:45:36,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:45:36 BasicIcfg [2024-11-16 23:45:36,125 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 23:45:36,126 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 23:45:36,126 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 23:45:36,126 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 23:45:36,126 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:44:28" (3/4) ... [2024-11-16 23:45:36,128 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 23:45:36,132 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-16 23:45:36,132 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-16 23:45:36,132 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-16 23:45:36,144 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 42 nodes and edges [2024-11-16 23:45:36,145 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-16 23:45:36,145 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 23:45:36,146 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 23:45:36,257 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 23:45:36,257 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 23:45:36,258 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 23:45:36,258 INFO L158 Benchmark]: Toolchain (without parser) took 69239.17ms. Allocated memory was 167.8MB in the beginning and 8.4GB in the end (delta: 8.2GB). Free memory was 111.8MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2024-11-16 23:45:36,258 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:45:36,259 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.83ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 95.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 23:45:36,259 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.99ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 92.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:45:36,259 INFO L158 Benchmark]: Boogie Preprocessor took 68.16ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 90.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:45:36,259 INFO L158 Benchmark]: IcfgBuilder took 1195.09ms. Allocated memory was 167.8MB in the beginning and 224.4MB in the end (delta: 56.6MB). Free memory was 90.0MB in the beginning and 160.1MB in the end (delta: -70.1MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-11-16 23:45:36,260 INFO L158 Benchmark]: TraceAbstraction took 67466.95ms. Allocated memory was 224.4MB in the beginning and 8.4GB in the end (delta: 8.1GB). Free memory was 160.1MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. [2024-11-16 23:45:36,260 INFO L158 Benchmark]: Witness Printer took 131.95ms. Allocated memory is still 8.4GB. Free memory was 4.1GB in the beginning and 4.1GB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 23:45:36,261 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.19ms. Allocated memory is still 167.8MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.83ms. Allocated memory is still 167.8MB. Free memory was 111.4MB in the beginning and 95.4MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.99ms. Allocated memory is still 167.8MB. Free memory was 95.4MB in the beginning and 92.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.16ms. Allocated memory is still 167.8MB. Free memory was 92.9MB in the beginning and 90.0MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1195.09ms. Allocated memory was 167.8MB in the beginning and 224.4MB in the end (delta: 56.6MB). Free memory was 90.0MB in the beginning and 160.1MB in the end (delta: -70.1MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * TraceAbstraction took 67466.95ms. Allocated memory was 224.4MB in the beginning and 8.4GB in the end (delta: 8.1GB). Free memory was 160.1MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 4.2GB. Max. memory is 16.1GB. * Witness Printer took 131.95ms. Allocated memory is still 8.4GB. Free memory was 4.1GB in the beginning and 4.1GB in the end (delta: 7.3MB). 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: 67.2s, OverallIterations: 46, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 59.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7007 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4389 mSDsluCounter, 7332 SdHoareTripleChecker+Invalid, 6.4s 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.8s 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.6s 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-16 23:45:36,302 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