./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-three-array-sum.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 c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:40:16,650 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:40:16,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:40:16,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:40:16,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:40:16,759 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:40:16,760 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:40:16,760 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:40:16,761 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:40:16,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:40:16,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:40:16,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:40:16,763 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:40:16,764 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:40:16,764 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:40:16,766 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:40:16,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:40:16,769 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:40:16,769 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:40:16,769 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:40:16,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:40:16,770 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:40:16,770 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:40:16,770 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:40:16,771 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:40:16,771 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:40:16,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:40:16,771 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:40:16,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:40:16,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:40:16,772 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:40:16,772 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:40:16,772 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:40:16,773 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:40:16,773 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:40:16,773 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:40:16,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:40:16,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:40:16,775 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:40:16,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:40:16,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:40:16,776 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 -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e [2024-11-12 12:40:17,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:40:17,043 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:40:17,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:40:17,049 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:40:17,050 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:40:17,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2024-11-12 12:40:18,503 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:40:18,693 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:40:18,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2024-11-12 12:40:18,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c095b22da/5b225e6800774fc1a59a207250416fe7/FLAGc12d30162 [2024-11-12 12:40:19,062 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c095b22da/5b225e6800774fc1a59a207250416fe7 [2024-11-12 12:40:19,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:40:19,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:40:19,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:40:19,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:40:19,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:40:19,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:40:19" (1/1) ... [2024-11-12 12:40:19,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d7b8144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:19, skipping insertion in model container [2024-11-12 12:40:19,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:40:19" (1/1) ... [2024-11-12 12:40:19,107 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:40:19,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:40:19,372 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:40:19,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:40:19,419 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:40:19,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:19 WrapperNode [2024-11-12 12:40:19,420 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:40:19,421 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:40:19,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:40:19,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:40:19,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:19" (1/1) ... [2024-11-12 12:40:19,442 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:19" (1/1) ... [2024-11-12 12:40:19,471 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 189 [2024-11-12 12:40:19,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:40:19,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:40:19,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:40:19,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:40:19,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:19" (1/1) ... [2024-11-12 12:40:19,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:19" (1/1) ... [2024-11-12 12:40:19,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:19" (1/1) ... [2024-11-12 12:40:19,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:19" (1/1) ... [2024-11-12 12:40:19,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:19" (1/1) ... [2024-11-12 12:40:19,512 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:19" (1/1) ... [2024-11-12 12:40:19,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:19" (1/1) ... [2024-11-12 12:40:19,516 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:19" (1/1) ... [2024-11-12 12:40:19,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:40:19,521 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:40:19,521 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:40:19,521 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:40:19,522 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:19" (1/1) ... [2024-11-12 12:40:19,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:40:19,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:40:19,563 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:40:19,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:40:19,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:40:19,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 12:40:19,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 12:40:19,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 12:40:19,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 12:40:19,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-12 12:40:19,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-12 12:40:19,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:40:19,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:40:19,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 12:40:19,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 12:40:19,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:40:19,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:40:19,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:40:19,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:40:19,621 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:40:19,727 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:40:19,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:40:20,315 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:40:20,315 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:40:20,474 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:40:20,474 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-12 12:40:20,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:20 BoogieIcfgContainer [2024-11-12 12:40:20,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:40:20,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:40:20,479 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:40:20,482 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:40:20,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:40:19" (1/3) ... [2024-11-12 12:40:20,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66dfdbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:40:20, skipping insertion in model container [2024-11-12 12:40:20,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:19" (2/3) ... [2024-11-12 12:40:20,484 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66dfdbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:40:20, skipping insertion in model container [2024-11-12 12:40:20,484 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:20" (3/3) ... [2024-11-12 12:40:20,485 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2024-11-12 12:40:20,501 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:40:20,503 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2024-11-12 12:40:20,503 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:40:20,595 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-12 12:40:20,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 344 transitions, 709 flow [2024-11-12 12:40:20,769 INFO L124 PetriNetUnfolderBase]: 20/341 cut-off events. [2024-11-12 12:40:20,770 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-12 12:40:20,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 341 events. 20/341 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 460 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 291. Up to 2 conditions per place. [2024-11-12 12:40:20,779 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 344 transitions, 709 flow [2024-11-12 12:40:20,787 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 315 places, 324 transitions, 666 flow [2024-11-12 12:40:20,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:40:20,806 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;@2d809167, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:40:20,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-12 12:40:20,813 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:40:20,813 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-12 12:40:20,814 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:40:20,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:20,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:20,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:20,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:20,823 INFO L85 PathProgramCache]: Analyzing trace with hash 335780089, now seen corresponding path program 1 times [2024-11-12 12:40:20,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:20,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597171280] [2024-11-12 12:40:20,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:20,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:21,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:21,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597171280] [2024-11-12 12:40:21,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597171280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:21,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:21,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:21,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131265108] [2024-11-12 12:40:21,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:21,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:21,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:21,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:21,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:21,139 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 344 [2024-11-12 12:40:21,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 324 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:21,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:21,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 344 [2024-11-12 12:40:21,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:21,389 INFO L124 PetriNetUnfolderBase]: 85/884 cut-off events. [2024-11-12 12:40:21,390 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-12 12:40:21,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 884 events. 85/884 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4499 event pairs, 51 based on Foata normal form. 9/749 useless extension candidates. Maximal degree in co-relation 759. Up to 134 conditions per place. [2024-11-12 12:40:21,402 INFO L140 encePairwiseOnDemand]: 317/344 looper letters, 18 selfloop transitions, 2 changer transitions 6/299 dead transitions. [2024-11-12 12:40:21,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 299 transitions, 656 flow [2024-11-12 12:40:21,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2024-11-12 12:40:21,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9040697674418605 [2024-11-12 12:40:21,426 INFO L175 Difference]: Start difference. First operand has 315 places, 324 transitions, 666 flow. Second operand 3 states and 933 transitions. [2024-11-12 12:40:21,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 299 transitions, 656 flow [2024-11-12 12:40:21,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 299 transitions, 644 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-12 12:40:21,438 INFO L231 Difference]: Finished difference. Result has 298 places, 293 transitions, 596 flow [2024-11-12 12:40:21,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=298, PETRI_TRANSITIONS=293} [2024-11-12 12:40:21,444 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -17 predicate places. [2024-11-12 12:40:21,446 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 293 transitions, 596 flow [2024-11-12 12:40:21,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:21,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:21,447 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:21,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:40:21,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:21,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:21,449 INFO L85 PathProgramCache]: Analyzing trace with hash -948979931, now seen corresponding path program 1 times [2024-11-12 12:40:21,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:21,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742043796] [2024-11-12 12:40:21,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:21,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:21,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:21,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742043796] [2024-11-12 12:40:21,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742043796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:21,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:21,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:21,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040286837] [2024-11-12 12:40:21,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:21,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:21,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:21,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:21,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:21,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 344 [2024-11-12 12:40:21,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 293 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:21,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:21,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 344 [2024-11-12 12:40:21,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:21,757 INFO L124 PetriNetUnfolderBase]: 213/995 cut-off events. [2024-11-12 12:40:21,758 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-12 12:40:21,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 995 events. 213/995 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5265 event pairs, 128 based on Foata normal form. 0/858 useless extension candidates. Maximal degree in co-relation 1281. Up to 297 conditions per place. [2024-11-12 12:40:21,766 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 21 selfloop transitions, 1 changer transitions 0/287 dead transitions. [2024-11-12 12:40:21,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 287 transitions, 628 flow [2024-11-12 12:40:21,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2024-11-12 12:40:21,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8701550387596899 [2024-11-12 12:40:21,771 INFO L175 Difference]: Start difference. First operand has 298 places, 293 transitions, 596 flow. Second operand 3 states and 898 transitions. [2024-11-12 12:40:21,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 287 transitions, 628 flow [2024-11-12 12:40:21,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 287 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:21,779 INFO L231 Difference]: Finished difference. Result has 286 places, 287 transitions, 582 flow [2024-11-12 12:40:21,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=286, PETRI_TRANSITIONS=287} [2024-11-12 12:40:21,782 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -29 predicate places. [2024-11-12 12:40:21,782 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 287 transitions, 582 flow [2024-11-12 12:40:21,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:21,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:21,783 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:21,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:40:21,783 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:21,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:21,784 INFO L85 PathProgramCache]: Analyzing trace with hash 785090757, now seen corresponding path program 1 times [2024-11-12 12:40:21,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:21,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251736659] [2024-11-12 12:40:21,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:21,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:22,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:22,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251736659] [2024-11-12 12:40:22,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251736659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:22,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:22,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:22,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840802981] [2024-11-12 12:40:22,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:22,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:22,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:22,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:22,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:22,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 344 [2024-11-12 12:40:22,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 287 transitions, 582 flow. Second operand has 6 states, 6 states have (on average 260.5) internal successors, (1563), 6 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:22,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:22,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 344 [2024-11-12 12:40:22,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:23,083 INFO L124 PetriNetUnfolderBase]: 157/944 cut-off events. [2024-11-12 12:40:23,083 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-12 12:40:23,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1253 conditions, 944 events. 157/944 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4613 event pairs, 100 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 1221. Up to 263 conditions per place. [2024-11-12 12:40:23,090 INFO L140 encePairwiseOnDemand]: 326/344 looper letters, 41 selfloop transitions, 15 changer transitions 0/284 dead transitions. [2024-11-12 12:40:23,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 284 transitions, 688 flow [2024-11-12 12:40:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:23,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1613 transitions. [2024-11-12 12:40:23,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7814922480620154 [2024-11-12 12:40:23,094 INFO L175 Difference]: Start difference. First operand has 286 places, 287 transitions, 582 flow. Second operand 6 states and 1613 transitions. [2024-11-12 12:40:23,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 284 transitions, 688 flow [2024-11-12 12:40:23,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 284 transitions, 687 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:23,099 INFO L231 Difference]: Finished difference. Result has 287 places, 284 transitions, 605 flow [2024-11-12 12:40:23,100 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=605, PETRI_PLACES=287, PETRI_TRANSITIONS=284} [2024-11-12 12:40:23,101 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -28 predicate places. [2024-11-12 12:40:23,101 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 605 flow [2024-11-12 12:40:23,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 260.5) internal successors, (1563), 6 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:23,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:23,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:23,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:40:23,103 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:23,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash 82838698, now seen corresponding path program 1 times [2024-11-12 12:40:23,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:23,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733840598] [2024-11-12 12:40:23,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:23,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:23,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:23,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733840598] [2024-11-12 12:40:23,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733840598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:23,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:23,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:23,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001169943] [2024-11-12 12:40:23,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:23,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:23,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:23,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:23,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:23,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 344 [2024-11-12 12:40:23,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 284 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:23,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:23,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 344 [2024-11-12 12:40:23,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:23,250 INFO L124 PetriNetUnfolderBase]: 45/439 cut-off events. [2024-11-12 12:40:23,251 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-12 12:40:23,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 439 events. 45/439 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1327 event pairs, 23 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 500. Up to 67 conditions per place. [2024-11-12 12:40:23,254 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 13 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2024-11-12 12:40:23,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 283 transitions, 633 flow [2024-11-12 12:40:23,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:23,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:23,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2024-11-12 12:40:23,257 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905038759689923 [2024-11-12 12:40:23,257 INFO L175 Difference]: Start difference. First operand has 287 places, 284 transitions, 605 flow. Second operand 3 states and 919 transitions. [2024-11-12 12:40:23,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 283 transitions, 633 flow [2024-11-12 12:40:23,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 283 transitions, 603 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:40:23,262 INFO L231 Difference]: Finished difference. Result has 283 places, 283 transitions, 577 flow [2024-11-12 12:40:23,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=283, PETRI_TRANSITIONS=283} [2024-11-12 12:40:23,264 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2024-11-12 12:40:23,265 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 283 transitions, 577 flow [2024-11-12 12:40:23,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:23,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:23,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:23,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:40:23,266 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:23,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:23,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1979469290, now seen corresponding path program 1 times [2024-11-12 12:40:23,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:23,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64092923] [2024-11-12 12:40:23,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:23,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:23,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:23,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64092923] [2024-11-12 12:40:23,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64092923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:23,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:23,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:23,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825674789] [2024-11-12 12:40:23,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:23,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:23,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:23,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:23,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:23,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 344 [2024-11-12 12:40:23,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 283 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:23,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:23,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 344 [2024-11-12 12:40:23,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:23,404 INFO L124 PetriNetUnfolderBase]: 45/438 cut-off events. [2024-11-12 12:40:23,405 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-12 12:40:23,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 438 events. 45/438 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1305 event pairs, 23 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 486. Up to 67 conditions per place. [2024-11-12 12:40:23,408 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 13 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2024-11-12 12:40:23,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 282 transitions, 605 flow [2024-11-12 12:40:23,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:23,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:23,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2024-11-12 12:40:23,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905038759689923 [2024-11-12 12:40:23,411 INFO L175 Difference]: Start difference. First operand has 283 places, 283 transitions, 577 flow. Second operand 3 states and 919 transitions. [2024-11-12 12:40:23,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 282 transitions, 605 flow [2024-11-12 12:40:23,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 282 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:23,416 INFO L231 Difference]: Finished difference. Result has 282 places, 282 transitions, 575 flow [2024-11-12 12:40:23,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=282, PETRI_TRANSITIONS=282} [2024-11-12 12:40:23,419 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -33 predicate places. [2024-11-12 12:40:23,419 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 282 transitions, 575 flow [2024-11-12 12:40:23,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:23,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:23,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:23,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:40:23,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:23,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:23,433 INFO L85 PathProgramCache]: Analyzing trace with hash -166747507, now seen corresponding path program 1 times [2024-11-12 12:40:23,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:23,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124149751] [2024-11-12 12:40:23,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:23,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:23,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:23,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124149751] [2024-11-12 12:40:23,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124149751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:23,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:23,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:23,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796016947] [2024-11-12 12:40:23,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:23,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:23,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:23,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:23,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:23,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 344 [2024-11-12 12:40:23,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 282 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:23,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:23,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 344 [2024-11-12 12:40:23,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:23,580 INFO L124 PetriNetUnfolderBase]: 28/352 cut-off events. [2024-11-12 12:40:23,580 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-12 12:40:23,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 352 events. 28/352 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 779 event pairs, 12 based on Foata normal form. 0/331 useless extension candidates. Maximal degree in co-relation 374. Up to 44 conditions per place. [2024-11-12 12:40:23,583 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 12 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2024-11-12 12:40:23,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 281 transitions, 601 flow [2024-11-12 12:40:23,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:23,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:23,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2024-11-12 12:40:23,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8924418604651163 [2024-11-12 12:40:23,586 INFO L175 Difference]: Start difference. First operand has 282 places, 282 transitions, 575 flow. Second operand 3 states and 921 transitions. [2024-11-12 12:40:23,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 281 transitions, 601 flow [2024-11-12 12:40:23,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 281 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:23,591 INFO L231 Difference]: Finished difference. Result has 281 places, 281 transitions, 573 flow [2024-11-12 12:40:23,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=281, PETRI_TRANSITIONS=281} [2024-11-12 12:40:23,592 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -34 predicate places. [2024-11-12 12:40:23,592 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 281 transitions, 573 flow [2024-11-12 12:40:23,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:23,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:23,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:23,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:40:23,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:23,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:23,595 INFO L85 PathProgramCache]: Analyzing trace with hash 2088733689, now seen corresponding path program 1 times [2024-11-12 12:40:23,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:23,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212857563] [2024-11-12 12:40:23,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:23,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:23,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:23,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212857563] [2024-11-12 12:40:23,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212857563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:23,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:23,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:23,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554570938] [2024-11-12 12:40:23,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:23,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:23,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:23,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:23,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:23,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 344 [2024-11-12 12:40:23,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 281 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:23,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:23,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 344 [2024-11-12 12:40:23,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:23,778 INFO L124 PetriNetUnfolderBase]: 84/726 cut-off events. [2024-11-12 12:40:23,778 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-12 12:40:23,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 870 conditions, 726 events. 84/726 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3137 event pairs, 23 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 838. Up to 70 conditions per place. [2024-11-12 12:40:23,784 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 16 selfloop transitions, 3 changer transitions 0/284 dead transitions. [2024-11-12 12:40:23,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 284 transitions, 619 flow [2024-11-12 12:40:23,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:23,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 927 transitions. [2024-11-12 12:40:23,786 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8982558139534884 [2024-11-12 12:40:23,786 INFO L175 Difference]: Start difference. First operand has 281 places, 281 transitions, 573 flow. Second operand 3 states and 927 transitions. [2024-11-12 12:40:23,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 284 transitions, 619 flow [2024-11-12 12:40:23,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 284 transitions, 615 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:23,790 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 571 flow [2024-11-12 12:40:23,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=279, PETRI_TRANSITIONS=279} [2024-11-12 12:40:23,792 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -36 predicate places. [2024-11-12 12:40:23,792 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 571 flow [2024-11-12 12:40:23,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:23,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:23,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:23,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:40:23,793 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:23,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:23,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1523378363, now seen corresponding path program 1 times [2024-11-12 12:40:23,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:23,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065849781] [2024-11-12 12:40:23,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:23,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:23,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:23,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065849781] [2024-11-12 12:40:23,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065849781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:23,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:23,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:23,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868592305] [2024-11-12 12:40:23,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:23,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:23,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:23,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:23,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:23,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 344 [2024-11-12 12:40:23,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:23,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:23,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 344 [2024-11-12 12:40:23,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:23,988 INFO L124 PetriNetUnfolderBase]: 76/765 cut-off events. [2024-11-12 12:40:23,988 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-12 12:40:23,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 765 events. 76/765 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3511 event pairs, 8 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 878. Up to 99 conditions per place. [2024-11-12 12:40:23,994 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 19 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2024-11-12 12:40:23,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 287 transitions, 634 flow [2024-11-12 12:40:23,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:23,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2024-11-12 12:40:23,997 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9079457364341085 [2024-11-12 12:40:23,997 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 571 flow. Second operand 3 states and 937 transitions. [2024-11-12 12:40:23,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 287 transitions, 634 flow [2024-11-12 12:40:23,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 287 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:24,003 INFO L231 Difference]: Finished difference. Result has 279 places, 280 transitions, 577 flow [2024-11-12 12:40:24,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=279, PETRI_TRANSITIONS=280} [2024-11-12 12:40:24,004 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -36 predicate places. [2024-11-12 12:40:24,005 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 280 transitions, 577 flow [2024-11-12 12:40:24,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:24,006 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:24,006 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:24,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:40:24,006 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:24,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:24,007 INFO L85 PathProgramCache]: Analyzing trace with hash -273573217, now seen corresponding path program 1 times [2024-11-12 12:40:24,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:24,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585299196] [2024-11-12 12:40:24,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:24,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:24,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:24,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:24,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585299196] [2024-11-12 12:40:24,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585299196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:24,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:24,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 12:40:24,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978299331] [2024-11-12 12:40:24,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:24,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 12:40:24,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:24,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 12:40:24,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-12 12:40:24,550 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 344 [2024-11-12 12:40:24,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 280 transitions, 577 flow. Second operand has 7 states, 7 states have (on average 280.14285714285717) internal successors, (1961), 7 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:24,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:24,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 344 [2024-11-12 12:40:24,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:25,002 INFO L124 PetriNetUnfolderBase]: 193/1399 cut-off events. [2024-11-12 12:40:25,003 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2024-11-12 12:40:25,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1932 conditions, 1399 events. 193/1399 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6802 event pairs, 96 based on Foata normal form. 9/1319 useless extension candidates. Maximal degree in co-relation 1898. Up to 201 conditions per place. [2024-11-12 12:40:25,015 INFO L140 encePairwiseOnDemand]: 315/344 looper letters, 52 selfloop transitions, 42 changer transitions 0/331 dead transitions. [2024-11-12 12:40:25,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 331 transitions, 885 flow [2024-11-12 12:40:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 12:40:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-12 12:40:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2852 transitions. [2024-11-12 12:40:25,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8290697674418605 [2024-11-12 12:40:25,021 INFO L175 Difference]: Start difference. First operand has 279 places, 280 transitions, 577 flow. Second operand 10 states and 2852 transitions. [2024-11-12 12:40:25,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 331 transitions, 885 flow [2024-11-12 12:40:25,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 331 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:40:25,027 INFO L231 Difference]: Finished difference. Result has 292 places, 305 transitions, 769 flow [2024-11-12 12:40:25,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=769, PETRI_PLACES=292, PETRI_TRANSITIONS=305} [2024-11-12 12:40:25,028 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2024-11-12 12:40:25,029 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 305 transitions, 769 flow [2024-11-12 12:40:25,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 280.14285714285717) internal successors, (1961), 7 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:25,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:25,030 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:25,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:40:25,030 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:25,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:25,031 INFO L85 PathProgramCache]: Analyzing trace with hash 172631913, now seen corresponding path program 1 times [2024-11-12 12:40:25,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:25,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987765946] [2024-11-12 12:40:25,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:25,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:25,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:25,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987765946] [2024-11-12 12:40:25,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987765946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:25,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:25,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:25,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416852675] [2024-11-12 12:40:25,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:25,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:25,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:25,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:25,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:25,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344 [2024-11-12 12:40:25,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 305 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:25,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:25,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344 [2024-11-12 12:40:25,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:25,275 INFO L124 PetriNetUnfolderBase]: 81/937 cut-off events. [2024-11-12 12:40:25,275 INFO L125 PetriNetUnfolderBase]: For 73/75 co-relation queries the response was YES. [2024-11-12 12:40:25,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 937 events. 81/937 cut-off events. For 73/75 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3505 event pairs, 30 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 1189. Up to 112 conditions per place. [2024-11-12 12:40:25,283 INFO L140 encePairwiseOnDemand]: 342/344 looper letters, 11 selfloop transitions, 1 changer transitions 0/304 dead transitions. [2024-11-12 12:40:25,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 304 transitions, 791 flow [2024-11-12 12:40:25,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2024-11-12 12:40:25,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9011627906976745 [2024-11-12 12:40:25,285 INFO L175 Difference]: Start difference. First operand has 292 places, 305 transitions, 769 flow. Second operand 3 states and 930 transitions. [2024-11-12 12:40:25,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 304 transitions, 791 flow [2024-11-12 12:40:25,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 304 transitions, 791 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:40:25,291 INFO L231 Difference]: Finished difference. Result has 293 places, 304 transitions, 769 flow [2024-11-12 12:40:25,292 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=293, PETRI_TRANSITIONS=304} [2024-11-12 12:40:25,292 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -22 predicate places. [2024-11-12 12:40:25,292 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 304 transitions, 769 flow [2024-11-12 12:40:25,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:25,293 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:25,293 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:25,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:40:25,294 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:25,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:25,294 INFO L85 PathProgramCache]: Analyzing trace with hash 34836619, now seen corresponding path program 1 times [2024-11-12 12:40:25,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:25,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791444552] [2024-11-12 12:40:25,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:25,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:25,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:25,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791444552] [2024-11-12 12:40:25,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791444552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:25,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:25,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:25,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063843052] [2024-11-12 12:40:25,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:25,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:25,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:25,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:25,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:25,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 344 [2024-11-12 12:40:25,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 304 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:25,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:25,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 344 [2024-11-12 12:40:25,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:25,569 INFO L124 PetriNetUnfolderBase]: 128/1063 cut-off events. [2024-11-12 12:40:25,569 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2024-11-12 12:40:25,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1461 conditions, 1063 events. 128/1063 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4499 event pairs, 37 based on Foata normal form. 4/1009 useless extension candidates. Maximal degree in co-relation 1424. Up to 136 conditions per place. [2024-11-12 12:40:25,575 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 15 selfloop transitions, 2 changer transitions 28/307 dead transitions. [2024-11-12 12:40:25,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 307 transitions, 817 flow [2024-11-12 12:40:25,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:25,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2024-11-12 12:40:25,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8972868217054264 [2024-11-12 12:40:25,578 INFO L175 Difference]: Start difference. First operand has 293 places, 304 transitions, 769 flow. Second operand 3 states and 926 transitions. [2024-11-12 12:40:25,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 307 transitions, 817 flow [2024-11-12 12:40:25,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 307 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:25,584 INFO L231 Difference]: Finished difference. Result has 292 places, 274 transitions, 644 flow [2024-11-12 12:40:25,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=292, PETRI_TRANSITIONS=274} [2024-11-12 12:40:25,586 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2024-11-12 12:40:25,586 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 274 transitions, 644 flow [2024-11-12 12:40:25,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:25,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:25,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:25,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:40:25,589 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:25,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:25,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1634000130, now seen corresponding path program 1 times [2024-11-12 12:40:25,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:25,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237277914] [2024-11-12 12:40:25,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:25,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:26,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:40:26,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:26,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237277914] [2024-11-12 12:40:26,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237277914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:26,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:26,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:26,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777677657] [2024-11-12 12:40:26,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:26,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:26,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:26,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:26,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:26,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 344 [2024-11-12 12:40:26,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 274 transitions, 644 flow. Second operand has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:26,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:26,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 344 [2024-11-12 12:40:26,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:26,929 INFO L124 PetriNetUnfolderBase]: 228/1362 cut-off events. [2024-11-12 12:40:26,930 INFO L125 PetriNetUnfolderBase]: For 162/169 co-relation queries the response was YES. [2024-11-12 12:40:26,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2020 conditions, 1362 events. 228/1362 cut-off events. For 162/169 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 8198 event pairs, 74 based on Foata normal form. 0/1268 useless extension candidates. Maximal degree in co-relation 1978. Up to 282 conditions per place. [2024-11-12 12:40:26,941 INFO L140 encePairwiseOnDemand]: 336/344 looper letters, 47 selfloop transitions, 10 changer transitions 0/299 dead transitions. [2024-11-12 12:40:26,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 299 transitions, 824 flow [2024-11-12 12:40:26,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1773 transitions. [2024-11-12 12:40:26,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8590116279069767 [2024-11-12 12:40:26,945 INFO L175 Difference]: Start difference. First operand has 292 places, 274 transitions, 644 flow. Second operand 6 states and 1773 transitions. [2024-11-12 12:40:26,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 299 transitions, 824 flow [2024-11-12 12:40:26,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 299 transitions, 768 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-11-12 12:40:26,951 INFO L231 Difference]: Finished difference. Result has 282 places, 283 transitions, 668 flow [2024-11-12 12:40:26,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=668, PETRI_PLACES=282, PETRI_TRANSITIONS=283} [2024-11-12 12:40:26,951 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -33 predicate places. [2024-11-12 12:40:26,952 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 283 transitions, 668 flow [2024-11-12 12:40:26,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:26,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:26,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:26,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:40:26,953 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:26,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:26,954 INFO L85 PathProgramCache]: Analyzing trace with hash 999190661, now seen corresponding path program 1 times [2024-11-12 12:40:26,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:26,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057388993] [2024-11-12 12:40:26,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:26,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:40:27,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:27,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057388993] [2024-11-12 12:40:27,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057388993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:27,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:27,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:27,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675452482] [2024-11-12 12:40:27,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:27,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:27,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:27,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:27,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:27,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 344 [2024-11-12 12:40:27,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 283 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:27,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:27,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 344 [2024-11-12 12:40:27,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:27,255 INFO L124 PetriNetUnfolderBase]: 254/1386 cut-off events. [2024-11-12 12:40:27,255 INFO L125 PetriNetUnfolderBase]: For 672/672 co-relation queries the response was YES. [2024-11-12 12:40:27,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2298 conditions, 1386 events. 254/1386 cut-off events. For 672/672 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 8323 event pairs, 84 based on Foata normal form. 0/1298 useless extension candidates. Maximal degree in co-relation 2260. Up to 265 conditions per place. [2024-11-12 12:40:27,268 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 22 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-11-12 12:40:27,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 288 transitions, 738 flow [2024-11-12 12:40:27,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2024-11-12 12:40:27,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8963178294573644 [2024-11-12 12:40:27,271 INFO L175 Difference]: Start difference. First operand has 282 places, 283 transitions, 668 flow. Second operand 3 states and 925 transitions. [2024-11-12 12:40:27,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 288 transitions, 738 flow [2024-11-12 12:40:27,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 288 transitions, 728 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-11-12 12:40:27,277 INFO L231 Difference]: Finished difference. Result has 283 places, 282 transitions, 662 flow [2024-11-12 12:40:27,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=283, PETRI_TRANSITIONS=282} [2024-11-12 12:40:27,278 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2024-11-12 12:40:27,279 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 282 transitions, 662 flow [2024-11-12 12:40:27,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:27,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:27,280 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:27,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:40:27,280 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:27,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:27,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1211790518, now seen corresponding path program 1 times [2024-11-12 12:40:27,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:27,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485505711] [2024-11-12 12:40:27,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:27,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:40:27,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:27,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485505711] [2024-11-12 12:40:27,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485505711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:27,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:27,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:27,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93543485] [2024-11-12 12:40:27,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:27,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:27,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:27,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:27,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:27,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 344 [2024-11-12 12:40:27,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 282 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:27,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:27,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 344 [2024-11-12 12:40:27,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:27,590 INFO L124 PetriNetUnfolderBase]: 187/1151 cut-off events. [2024-11-12 12:40:27,590 INFO L125 PetriNetUnfolderBase]: For 407/418 co-relation queries the response was YES. [2024-11-12 12:40:27,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 1151 events. 187/1151 cut-off events. For 407/418 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6057 event pairs, 4 based on Foata normal form. 0/1083 useless extension candidates. Maximal degree in co-relation 1808. Up to 213 conditions per place. [2024-11-12 12:40:27,601 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 21 selfloop transitions, 7 changer transitions 0/293 dead transitions. [2024-11-12 12:40:27,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 293 transitions, 764 flow [2024-11-12 12:40:27,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:27,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2024-11-12 12:40:27,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060077519379846 [2024-11-12 12:40:27,605 INFO L175 Difference]: Start difference. First operand has 283 places, 282 transitions, 662 flow. Second operand 3 states and 935 transitions. [2024-11-12 12:40:27,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 293 transitions, 764 flow [2024-11-12 12:40:27,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 293 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:27,611 INFO L231 Difference]: Finished difference. Result has 283 places, 287 transitions, 721 flow [2024-11-12 12:40:27,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=283, PETRI_TRANSITIONS=287} [2024-11-12 12:40:27,612 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2024-11-12 12:40:27,612 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 287 transitions, 721 flow [2024-11-12 12:40:27,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:27,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:27,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:27,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:40:27,614 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:27,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2014053489, now seen corresponding path program 1 times [2024-11-12 12:40:27,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:27,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25986634] [2024-11-12 12:40:27,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:27,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:29,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:40:29,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:29,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25986634] [2024-11-12 12:40:29,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25986634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:29,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:29,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-12 12:40:29,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706871540] [2024-11-12 12:40:29,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:29,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 12:40:29,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:29,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 12:40:29,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2024-11-12 12:40:31,647 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 344 [2024-11-12 12:40:31,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 287 transitions, 721 flow. Second operand has 22 states, 22 states have (on average 252.54545454545453) internal successors, (5556), 22 states have internal predecessors, (5556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:31,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:31,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 344 [2024-11-12 12:40:31,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:33,584 INFO L124 PetriNetUnfolderBase]: 672/2542 cut-off events. [2024-11-12 12:40:33,584 INFO L125 PetriNetUnfolderBase]: For 915/946 co-relation queries the response was YES. [2024-11-12 12:40:33,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4685 conditions, 2542 events. 672/2542 cut-off events. For 915/946 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 18430 event pairs, 168 based on Foata normal form. 26/2406 useless extension candidates. Maximal degree in co-relation 4642. Up to 363 conditions per place. [2024-11-12 12:40:33,609 INFO L140 encePairwiseOnDemand]: 312/344 looper letters, 77 selfloop transitions, 35 changer transitions 0/318 dead transitions. [2024-11-12 12:40:33,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 318 transitions, 1037 flow [2024-11-12 12:40:33,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-12 12:40:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-12 12:40:33,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 8098 transitions. [2024-11-12 12:40:33,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7356468023255814 [2024-11-12 12:40:33,626 INFO L175 Difference]: Start difference. First operand has 283 places, 287 transitions, 721 flow. Second operand 32 states and 8098 transitions. [2024-11-12 12:40:33,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 318 transitions, 1037 flow [2024-11-12 12:40:33,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 318 transitions, 1037 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:40:33,635 INFO L231 Difference]: Finished difference. Result has 313 places, 286 transitions, 787 flow [2024-11-12 12:40:33,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=787, PETRI_PLACES=313, PETRI_TRANSITIONS=286} [2024-11-12 12:40:33,637 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -2 predicate places. [2024-11-12 12:40:33,637 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 286 transitions, 787 flow [2024-11-12 12:40:33,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 252.54545454545453) internal successors, (5556), 22 states have internal predecessors, (5556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:33,639 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:33,640 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:33,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:40:33,640 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:33,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:33,641 INFO L85 PathProgramCache]: Analyzing trace with hash 336067950, now seen corresponding path program 1 times [2024-11-12 12:40:33,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:33,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018550136] [2024-11-12 12:40:33,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:33,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:40:34,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:34,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018550136] [2024-11-12 12:40:34,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018550136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:34,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:34,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:34,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522317887] [2024-11-12 12:40:34,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:34,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:34,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:34,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:34,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:34,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 344 [2024-11-12 12:40:34,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 286 transitions, 787 flow. Second operand has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:34,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:34,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 344 [2024-11-12 12:40:34,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:35,002 INFO L124 PetriNetUnfolderBase]: 370/1801 cut-off events. [2024-11-12 12:40:35,003 INFO L125 PetriNetUnfolderBase]: For 1458/1466 co-relation queries the response was YES. [2024-11-12 12:40:35,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3466 conditions, 1801 events. 370/1801 cut-off events. For 1458/1466 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 11607 event pairs, 85 based on Foata normal form. 8/1711 useless extension candidates. Maximal degree in co-relation 3425. Up to 413 conditions per place. [2024-11-12 12:40:35,019 INFO L140 encePairwiseOnDemand]: 336/344 looper letters, 56 selfloop transitions, 15 changer transitions 0/315 dead transitions. [2024-11-12 12:40:35,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 315 transitions, 1047 flow [2024-11-12 12:40:35,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:35,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1773 transitions. [2024-11-12 12:40:35,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8590116279069767 [2024-11-12 12:40:35,024 INFO L175 Difference]: Start difference. First operand has 313 places, 286 transitions, 787 flow. Second operand 6 states and 1773 transitions. [2024-11-12 12:40:35,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 315 transitions, 1047 flow [2024-11-12 12:40:35,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 315 transitions, 975 flow, removed 0 selfloop flow, removed 31 redundant places. [2024-11-12 12:40:35,032 INFO L231 Difference]: Finished difference. Result has 292 places, 299 transitions, 869 flow [2024-11-12 12:40:35,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=869, PETRI_PLACES=292, PETRI_TRANSITIONS=299} [2024-11-12 12:40:35,033 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2024-11-12 12:40:35,033 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 299 transitions, 869 flow [2024-11-12 12:40:35,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:35,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:35,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:35,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 12:40:35,035 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:35,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:35,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1382227983, now seen corresponding path program 1 times [2024-11-12 12:40:35,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:35,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898316170] [2024-11-12 12:40:35,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:35,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:40:35,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:35,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898316170] [2024-11-12 12:40:35,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898316170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:35,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:35,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:35,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192384162] [2024-11-12 12:40:35,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:35,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:35,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:35,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:35,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:35,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 344 [2024-11-12 12:40:35,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 299 transitions, 869 flow. Second operand has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:35,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:35,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 344 [2024-11-12 12:40:35,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:35,438 INFO L124 PetriNetUnfolderBase]: 426/1665 cut-off events. [2024-11-12 12:40:35,439 INFO L125 PetriNetUnfolderBase]: For 3481/3508 co-relation queries the response was YES. [2024-11-12 12:40:35,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3884 conditions, 1665 events. 426/1665 cut-off events. For 3481/3508 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9866 event pairs, 92 based on Foata normal form. 0/1568 useless extension candidates. Maximal degree in co-relation 3840. Up to 429 conditions per place. [2024-11-12 12:40:35,461 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 36 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2024-11-12 12:40:35,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 305 transitions, 987 flow [2024-11-12 12:40:35,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2024-11-12 12:40:35,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8963178294573644 [2024-11-12 12:40:35,465 INFO L175 Difference]: Start difference. First operand has 292 places, 299 transitions, 869 flow. Second operand 3 states and 925 transitions. [2024-11-12 12:40:35,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 305 transitions, 987 flow [2024-11-12 12:40:35,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 305 transitions, 957 flow, removed 15 selfloop flow, removed 0 redundant places. [2024-11-12 12:40:35,475 INFO L231 Difference]: Finished difference. Result has 293 places, 298 transitions, 847 flow [2024-11-12 12:40:35,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=293, PETRI_TRANSITIONS=298} [2024-11-12 12:40:35,476 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -22 predicate places. [2024-11-12 12:40:35,476 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 298 transitions, 847 flow [2024-11-12 12:40:35,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:35,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:35,476 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:35,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 12:40:35,477 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:35,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash -503447583, now seen corresponding path program 1 times [2024-11-12 12:40:35,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:35,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924440851] [2024-11-12 12:40:35,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:40:36,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:36,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924440851] [2024-11-12 12:40:36,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924440851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:40:36,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795857313] [2024-11-12 12:40:36,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:36,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:40:36,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:40:36,901 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:40:36,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 12:40:37,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:37,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 12:40:37,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:40:37,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 12:40:37,247 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 12:40:37,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 12:40:37,609 INFO L349 Elim1Store]: treesize reduction 648, result has 5.1 percent of original size [2024-11-12 12:40:37,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 77 [2024-11-12 12:40:37,636 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-12 12:40:37,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 67 [2024-11-12 12:40:37,690 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:40:37,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:40:37,870 INFO L349 Elim1Store]: treesize reduction 764, result has 11.9 percent of original size [2024-11-12 12:40:37,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 118 [2024-11-12 12:40:37,980 INFO L349 Elim1Store]: treesize reduction 200, result has 30.6 percent of original size [2024-11-12 12:40:37,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 134 treesize of output 142 [2024-11-12 12:40:37,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2024-11-12 12:40:38,052 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-12 12:40:38,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 122 treesize of output 1 [2024-11-12 12:40:38,103 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-12 12:40:38,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 1 [2024-11-12 12:40:38,151 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-12 12:40:38,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 1 [2024-11-12 12:40:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:40:38,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795857313] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:40:38,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:40:38,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2024-11-12 12:40:38,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654993042] [2024-11-12 12:40:38,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:40:38,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 12:40:38,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:38,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 12:40:38,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-11-12 12:40:40,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 344 [2024-11-12 12:40:40,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 298 transitions, 847 flow. Second operand has 22 states, 22 states have (on average 261.0) internal successors, (5742), 22 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:40,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:40,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 344 [2024-11-12 12:40:40,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:42,436 INFO L124 PetriNetUnfolderBase]: 1346/5268 cut-off events. [2024-11-12 12:40:42,436 INFO L125 PetriNetUnfolderBase]: For 5351/5733 co-relation queries the response was YES. [2024-11-12 12:40:42,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10972 conditions, 5268 events. 1346/5268 cut-off events. For 5351/5733 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 44949 event pairs, 239 based on Foata normal form. 136/5115 useless extension candidates. Maximal degree in co-relation 10924. Up to 672 conditions per place. [2024-11-12 12:40:42,486 INFO L140 encePairwiseOnDemand]: 312/344 looper letters, 111 selfloop transitions, 58 changer transitions 0/388 dead transitions. [2024-11-12 12:40:42,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 388 transitions, 1728 flow [2024-11-12 12:40:42,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 12:40:42,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-12 12:40:42,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 6556 transitions. [2024-11-12 12:40:42,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7623255813953488 [2024-11-12 12:40:42,496 INFO L175 Difference]: Start difference. First operand has 293 places, 298 transitions, 847 flow. Second operand 25 states and 6556 transitions. [2024-11-12 12:40:42,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 388 transitions, 1728 flow [2024-11-12 12:40:42,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 388 transitions, 1724 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:42,510 INFO L231 Difference]: Finished difference. Result has 320 places, 330 transitions, 1268 flow [2024-11-12 12:40:42,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1268, PETRI_PLACES=320, PETRI_TRANSITIONS=330} [2024-11-12 12:40:42,511 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 5 predicate places. [2024-11-12 12:40:42,512 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 330 transitions, 1268 flow [2024-11-12 12:40:42,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 261.0) internal successors, (5742), 22 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:42,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:42,514 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:42,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 12:40:42,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-12 12:40:42,719 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:42,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:42,720 INFO L85 PathProgramCache]: Analyzing trace with hash 746794041, now seen corresponding path program 2 times [2024-11-12 12:40:42,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:42,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776292283] [2024-11-12 12:40:42,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:42,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:44,046 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:40:44,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:44,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776292283] [2024-11-12 12:40:44,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776292283] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:40:44,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102959311] [2024-11-12 12:40:44,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 12:40:44,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:40:44,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:40:44,049 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:40:44,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 12:40:44,281 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 12:40:44,281 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:40:44,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-12 12:40:44,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:40:44,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 12:40:44,486 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 12:40:44,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 12:40:44,772 INFO L349 Elim1Store]: treesize reduction 648, result has 5.1 percent of original size [2024-11-12 12:40:44,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 77 [2024-11-12 12:40:44,796 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-12 12:40:44,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 67 [2024-11-12 12:40:44,809 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:40:44,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:40:44,968 INFO L349 Elim1Store]: treesize reduction 764, result has 11.9 percent of original size [2024-11-12 12:40:44,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 118 [2024-11-12 12:40:45,047 INFO L349 Elim1Store]: treesize reduction 200, result has 30.6 percent of original size [2024-11-12 12:40:45,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 134 treesize of output 142 [2024-11-12 12:40:45,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2024-11-12 12:40:45,116 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-12 12:40:45,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 1 [2024-11-12 12:40:45,167 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-12 12:40:45,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 1 [2024-11-12 12:40:45,204 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-12 12:40:45,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 122 treesize of output 1 [2024-11-12 12:40:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:40:45,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102959311] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:40:45,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:40:45,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2024-11-12 12:40:45,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3264908] [2024-11-12 12:40:45,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:40:45,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 12:40:45,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:45,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 12:40:45,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-11-12 12:40:47,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 344 [2024-11-12 12:40:47,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 330 transitions, 1268 flow. Second operand has 22 states, 22 states have (on average 261.0) internal successors, (5742), 22 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:47,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:47,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 344 [2024-11-12 12:40:47,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:49,468 INFO L124 PetriNetUnfolderBase]: 2166/8008 cut-off events. [2024-11-12 12:40:49,468 INFO L125 PetriNetUnfolderBase]: For 13715/14501 co-relation queries the response was YES. [2024-11-12 12:40:49,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18485 conditions, 8008 events. 2166/8008 cut-off events. For 13715/14501 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 77582 event pairs, 378 based on Foata normal form. 260/7706 useless extension candidates. Maximal degree in co-relation 18432. Up to 1586 conditions per place. [2024-11-12 12:40:49,564 INFO L140 encePairwiseOnDemand]: 312/344 looper letters, 116 selfloop transitions, 84 changer transitions 1/420 dead transitions. [2024-11-12 12:40:49,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 420 transitions, 2345 flow [2024-11-12 12:40:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 12:40:49,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-12 12:40:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 6820 transitions. [2024-11-12 12:40:49,576 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7625223613595706 [2024-11-12 12:40:49,576 INFO L175 Difference]: Start difference. First operand has 320 places, 330 transitions, 1268 flow. Second operand 26 states and 6820 transitions. [2024-11-12 12:40:49,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 420 transitions, 2345 flow [2024-11-12 12:40:49,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 420 transitions, 2300 flow, removed 0 selfloop flow, removed 18 redundant places. [2024-11-12 12:40:49,605 INFO L231 Difference]: Finished difference. Result has 332 places, 368 transitions, 1837 flow [2024-11-12 12:40:49,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1837, PETRI_PLACES=332, PETRI_TRANSITIONS=368} [2024-11-12 12:40:49,607 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 17 predicate places. [2024-11-12 12:40:49,607 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 368 transitions, 1837 flow [2024-11-12 12:40:49,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 261.0) internal successors, (5742), 22 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:49,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:49,612 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:49,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 12:40:49,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:40:49,813 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:49,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:49,815 INFO L85 PathProgramCache]: Analyzing trace with hash 961056649, now seen corresponding path program 1 times [2024-11-12 12:40:49,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:49,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555390700] [2024-11-12 12:40:49,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:49,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-12 12:40:50,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:50,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555390700] [2024-11-12 12:40:50,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555390700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:40:50,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984573770] [2024-11-12 12:40:50,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:50,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:40:50,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:40:50,201 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:40:50,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 12:40:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:50,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 12:40:50,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:40:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-12 12:40:50,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:40:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-12 12:40:51,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984573770] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:40:51,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:40:51,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-12 12:40:51,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942217252] [2024-11-12 12:40:51,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:40:51,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 12:40:51,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:51,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 12:40:51,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-11-12 12:40:51,932 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 344 [2024-11-12 12:40:51,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 368 transitions, 1837 flow. Second operand has 24 states, 24 states have (on average 267.125) internal successors, (6411), 24 states have internal predecessors, (6411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:51,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:51,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 344 [2024-11-12 12:40:51,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:54,776 INFO L124 PetriNetUnfolderBase]: 3842/13225 cut-off events. [2024-11-12 12:40:54,776 INFO L125 PetriNetUnfolderBase]: For 24250/28284 co-relation queries the response was YES. [2024-11-12 12:40:54,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32686 conditions, 13225 events. 3842/13225 cut-off events. For 24250/28284 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 134563 event pairs, 1405 based on Foata normal form. 474/12891 useless extension candidates. Maximal degree in co-relation 32629. Up to 3614 conditions per place. [2024-11-12 12:40:55,095 INFO L140 encePairwiseOnDemand]: 302/344 looper letters, 164 selfloop transitions, 97 changer transitions 0/520 dead transitions. [2024-11-12 12:40:55,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 520 transitions, 3215 flow [2024-11-12 12:40:55,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 12:40:55,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-12 12:40:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6234 transitions. [2024-11-12 12:40:55,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.787917087967644 [2024-11-12 12:40:55,107 INFO L175 Difference]: Start difference. First operand has 332 places, 368 transitions, 1837 flow. Second operand 23 states and 6234 transitions. [2024-11-12 12:40:55,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 520 transitions, 3215 flow [2024-11-12 12:40:55,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 520 transitions, 3082 flow, removed 41 selfloop flow, removed 18 redundant places. [2024-11-12 12:40:55,172 INFO L231 Difference]: Finished difference. Result has 348 places, 433 transitions, 2397 flow [2024-11-12 12:40:55,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1748, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2397, PETRI_PLACES=348, PETRI_TRANSITIONS=433} [2024-11-12 12:40:55,173 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 33 predicate places. [2024-11-12 12:40:55,174 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 433 transitions, 2397 flow [2024-11-12 12:40:55,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 267.125) internal successors, (6411), 24 states have internal predecessors, (6411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:55,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:55,176 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:55,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 12:40:55,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:40:55,378 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:40:55,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:55,379 INFO L85 PathProgramCache]: Analyzing trace with hash -99120851, now seen corresponding path program 1 times [2024-11-12 12:40:55,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:55,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175709099] [2024-11-12 12:40:55,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:55,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:55,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-12 12:40:55,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:55,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175709099] [2024-11-12 12:40:55,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175709099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:40:55,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799999699] [2024-11-12 12:40:55,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:55,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:40:55,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:40:55,770 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:40:55,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 12:40:55,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:55,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 12:40:55,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:40:56,396 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-12 12:40:56,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:40:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-12 12:40:56,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799999699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:40:56,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 12:40:56,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-12 12:40:56,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259944498] [2024-11-12 12:40:56,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 12:40:56,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-12 12:40:56,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:56,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-12 12:40:56,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-11-12 12:40:57,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 344 [2024-11-12 12:40:57,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 433 transitions, 2397 flow. Second operand has 24 states, 24 states have (on average 267.0833333333333) internal successors, (6410), 24 states have internal predecessors, (6410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:57,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:57,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 344 [2024-11-12 12:40:57,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:41:00,959 INFO L124 PetriNetUnfolderBase]: 2319/10937 cut-off events. [2024-11-12 12:41:00,959 INFO L125 PetriNetUnfolderBase]: For 25130/25385 co-relation queries the response was YES. [2024-11-12 12:41:01,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29555 conditions, 10937 events. 2319/10937 cut-off events. For 25130/25385 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 106958 event pairs, 676 based on Foata normal form. 99/10709 useless extension candidates. Maximal degree in co-relation 29482. Up to 1698 conditions per place. [2024-11-12 12:41:01,081 INFO L140 encePairwiseOnDemand]: 302/344 looper letters, 96 selfloop transitions, 44 changer transitions 151/544 dead transitions. [2024-11-12 12:41:01,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 544 transitions, 3808 flow [2024-11-12 12:41:01,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 12:41:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-12 12:41:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6240 transitions. [2024-11-12 12:41:01,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.788675429726997 [2024-11-12 12:41:01,091 INFO L175 Difference]: Start difference. First operand has 348 places, 433 transitions, 2397 flow. Second operand 23 states and 6240 transitions. [2024-11-12 12:41:01,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 544 transitions, 3808 flow [2024-11-12 12:41:01,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 544 transitions, 3768 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-11-12 12:41:01,241 INFO L231 Difference]: Finished difference. Result has 374 places, 380 transitions, 2080 flow [2024-11-12 12:41:01,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=2326, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2080, PETRI_PLACES=374, PETRI_TRANSITIONS=380} [2024-11-12 12:41:01,242 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 59 predicate places. [2024-11-12 12:41:01,242 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 380 transitions, 2080 flow [2024-11-12 12:41:01,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 267.0833333333333) internal successors, (6410), 24 states have internal predecessors, (6410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:41:01,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:41:01,245 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:41:01,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 12:41:01,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:41:01,446 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-12 12:41:01,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:41:01,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1544387834, now seen corresponding path program 2 times [2024-11-12 12:41:01,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:41:01,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110018572] [2024-11-12 12:41:01,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:41:01,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:41:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:41:04,082 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-12 12:41:04,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:41:04,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110018572] [2024-11-12 12:41:04,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110018572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 12:41:04,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136864842] [2024-11-12 12:41:04,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 12:41:04,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 12:41:04,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:41:04,084 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 12:41:04,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-12 12:41:04,583 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 12:41:04,583 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:41:04,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-12 12:41:04,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:41:04,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-12 12:41:04,889 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-12 12:41:04,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-12 12:41:06,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 12:41:06,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-12 12:41:06,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-12 12:41:06,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-12 12:41:06,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:06,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:06,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:06,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:06,456 INFO L349 Elim1Store]: treesize reduction 188, result has 38.4 percent of original size [2024-11-12 12:41:06,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 281 treesize of output 212 [2024-11-12 12:41:11,125 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-12 12:41:11,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:41:15,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse1 (+ .cse11 c_~C~0.offset)) (.cse4 (+ .cse11 2 c_~C~0.offset)) (.cse5 (+ .cse11 3 c_~C~0.offset)) (.cse3 (+ .cse11 c_~C~0.offset 1)) (.cse0 (let ((.cse10 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse11) 0) (+ c_~A~0.offset .cse11 1) 0) (+ c_~A~0.offset .cse11 2) 0) (+ c_~A~0.offset .cse11 3) 0)))) (store .cse10 c_~B~0.base (store (store (store (store (select .cse10 c_~B~0.base) (+ .cse11 c_~B~0.offset) 0) (+ .cse11 c_~B~0.offset 1) 0) (+ .cse11 2 c_~B~0.offset) 0) (+ .cse11 3 c_~B~0.offset) 0)))) (.cse6 (* c_thread1Thread1of1ForFork0_~i~0 4))) (and (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (not (= (let ((.cse2 (select v_ArrVal_1238 .cse3))) (store (store (store (store (select .cse0 ~C~0.base) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2) .cse5 .cse2)) v_ArrVal_1238)) (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) (+ .cse6 c_~B~0.offset 1)) 0))) (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (not (= (let ((.cse7 (select v_ArrVal_1238 .cse3))) (store (store (store (store (select .cse0 ~C~0.base) .cse1 .cse7) .cse3 .cse7) .cse4 .cse7) .cse5 .cse7)) v_ArrVal_1238)) (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) (+ 2 .cse6 c_~B~0.offset)) 0))) (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (not (= (let ((.cse8 (select v_ArrVal_1238 .cse3))) (store (store (store (store (select .cse0 ~C~0.base) .cse1 .cse8) .cse3 .cse8) .cse4 .cse8) .cse5 .cse8)) v_ArrVal_1238)) (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) (+ 3 .cse6 c_~B~0.offset)) 0))) (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (not (= (let ((.cse9 (select v_ArrVal_1238 .cse3))) (store (store (store (store (select .cse0 ~C~0.base) .cse1 .cse9) .cse3 .cse9) .cse4 .cse9) .cse5 .cse9)) v_ArrVal_1238)) (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) (+ .cse6 c_~B~0.offset)) 0)))))) is different from false [2024-11-12 12:41:18,947 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse11 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse8 (+ 3 .cse1 c_~B~0.offset))) (let ((.cse0 (let ((.cse13 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse8 0)))) (let ((.cse12 (store (store (store (store (select .cse13 c_~A~0.base) (+ c_~A~0.offset .cse11) 0) (+ c_~A~0.offset .cse11 1) 0) (+ c_~A~0.offset .cse11 2) 0) (+ c_~A~0.offset .cse11 3) 0))) (store (store |c_#race| c_~A~0.base .cse12) c_~B~0.base (store (store (store (store (select (store .cse13 c_~A~0.base .cse12) c_~B~0.base) (+ .cse11 c_~B~0.offset) 0) (+ .cse11 c_~B~0.offset 1) 0) (+ .cse11 2 c_~B~0.offset) 0) (+ .cse11 3 c_~B~0.offset) 0))))) (.cse2 (+ .cse11 c_~C~0.offset)) (.cse5 (+ .cse11 2 c_~C~0.offset)) (.cse6 (+ .cse11 3 c_~C~0.offset)) (.cse4 (+ .cse11 c_~C~0.offset 1))) (and (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) (+ 2 .cse1 c_~B~0.offset)) 0) (not (= (let ((.cse3 (select v_ArrVal_1238 .cse4))) (store (store (store (store (select .cse0 ~C~0.base) .cse2 .cse3) .cse4 .cse3) .cse5 .cse3) .cse6 .cse3)) v_ArrVal_1238)))) (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0) (not (= (let ((.cse7 (select v_ArrVal_1238 .cse4))) (store (store (store (store (select .cse0 ~C~0.base) .cse2 .cse7) .cse4 .cse7) .cse5 .cse7) .cse6 .cse7)) v_ArrVal_1238)))) (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) .cse8) 0) (not (= (let ((.cse9 (select v_ArrVal_1238 .cse4))) (store (store (store (store (select .cse0 ~C~0.base) .cse2 .cse9) .cse4 .cse9) .cse5 .cse9) .cse6 .cse9)) v_ArrVal_1238)))) (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0) (not (= (let ((.cse10 (select v_ArrVal_1238 .cse4))) (store (store (store (store (select .cse0 ~C~0.base) .cse2 .cse10) .cse4 .cse10) .cse5 .cse10) .cse6 .cse10)) v_ArrVal_1238)))))))) is different from false [2024-11-12 12:41:23,381 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse12 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse1 (+ 2 .cse7 c_~B~0.offset)) (.cse9 (+ 3 .cse7 c_~B~0.offset))) (let ((.cse0 (let ((.cse14 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse1 0) .cse9 0)))) (let ((.cse13 (store (store (store (store (select .cse14 c_~A~0.base) (+ c_~A~0.offset .cse12) 0) (+ c_~A~0.offset .cse12 1) 0) (+ c_~A~0.offset .cse12 2) 0) (+ c_~A~0.offset .cse12 3) 0))) (store (store |c_#race| c_~A~0.base .cse13) c_~B~0.base (store (store (store (store (select (store .cse14 c_~A~0.base .cse13) c_~B~0.base) (+ .cse12 c_~B~0.offset) 0) (+ .cse12 c_~B~0.offset 1) 0) (+ .cse12 2 c_~B~0.offset) 0) (+ .cse12 3 c_~B~0.offset) 0))))) (.cse2 (+ .cse12 c_~C~0.offset)) (.cse5 (+ .cse12 2 c_~C~0.offset)) (.cse6 (+ .cse12 3 c_~C~0.offset)) (.cse4 (+ .cse12 c_~C~0.offset 1))) (and (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) .cse1) 0) (not (= (let ((.cse3 (select v_ArrVal_1238 .cse4))) (store (store (store (store (select .cse0 ~C~0.base) .cse2 .cse3) .cse4 .cse3) .cse5 .cse3) .cse6 .cse3)) v_ArrVal_1238)))) (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) (+ .cse7 c_~B~0.offset 1)) 0) (not (= (let ((.cse8 (select v_ArrVal_1238 .cse4))) (store (store (store (store (select .cse0 ~C~0.base) .cse2 .cse8) .cse4 .cse8) .cse5 .cse8) .cse6 .cse8)) v_ArrVal_1238)))) (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) .cse9) 0) (not (= (let ((.cse10 (select v_ArrVal_1238 .cse4))) (store (store (store (store (select .cse0 ~C~0.base) .cse2 .cse10) .cse4 .cse10) .cse5 .cse10) .cse6 .cse10)) v_ArrVal_1238)))) (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) (+ .cse7 c_~B~0.offset)) 0) (not (= (let ((.cse11 (select v_ArrVal_1238 .cse4))) (store (store (store (store (select .cse0 ~C~0.base) .cse2 .cse11) .cse4 .cse11) .cse5 .cse11) .cse6 .cse11)) v_ArrVal_1238)))))))) is different from false [2024-11-12 12:41:25,677 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse10 (+ .cse8 c_~B~0.offset 1)) (.cse6 (+ 2 .cse8 c_~B~0.offset)) (.cse12 (+ 3 .cse8 c_~B~0.offset)) (.cse15 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse1 (+ .cse15 c_~C~0.offset)) (.cse4 (+ .cse15 2 c_~C~0.offset)) (.cse5 (+ .cse15 3 c_~C~0.offset)) (.cse3 (+ .cse15 c_~C~0.offset 1)) (.cse0 (let ((.cse14 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse10 0) .cse6 0) .cse12 0)))) (let ((.cse13 (store (store (store (store (select .cse14 c_~A~0.base) (+ c_~A~0.offset .cse15) 0) (+ c_~A~0.offset .cse15 1) 0) (+ c_~A~0.offset .cse15 2) 0) (+ c_~A~0.offset .cse15 3) 0))) (store (store |c_#race| c_~A~0.base .cse13) c_~B~0.base (store (store (store (store (select (store .cse14 c_~A~0.base .cse13) c_~B~0.base) (+ .cse15 c_~B~0.offset) 0) (+ .cse15 c_~B~0.offset 1) 0) (+ .cse15 2 c_~B~0.offset) 0) (+ .cse15 3 c_~B~0.offset) 0)))))) (and (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (not (= v_ArrVal_1238 (let ((.cse2 (select v_ArrVal_1238 .cse3))) (store (store (store (store (select .cse0 ~C~0.base) .cse1 .cse2) .cse3 .cse2) .cse4 .cse2) .cse5 .cse2)))) (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) .cse6) 0))) (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (not (= v_ArrVal_1238 (let ((.cse7 (select v_ArrVal_1238 .cse3))) (store (store (store (store (select .cse0 ~C~0.base) .cse1 .cse7) .cse3 .cse7) .cse4 .cse7) .cse5 .cse7)))) (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) (+ .cse8 c_~B~0.offset)) 0))) (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (not (= v_ArrVal_1238 (let ((.cse9 (select v_ArrVal_1238 .cse3))) (store (store (store (store (select .cse0 ~C~0.base) .cse1 .cse9) .cse3 .cse9) .cse4 .cse9) .cse5 .cse9)))) (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) .cse10) 0))) (forall ((v_ArrVal_1238 (Array Int Int)) (~C~0.base Int)) (or (not (= v_ArrVal_1238 (let ((.cse11 (select v_ArrVal_1238 .cse3))) (store (store (store (store (select .cse0 ~C~0.base) .cse1 .cse11) .cse3 .cse11) .cse4 .cse11) .cse5 .cse11)))) (= (select (select (store .cse0 ~C~0.base v_ArrVal_1238) c_~B~0.base) .cse12) 0))))))) is different from false [2024-11-12 12:41:26,116 INFO L349 Elim1Store]: treesize reduction 56, result has 42.9 percent of original size [2024-11-12 12:41:26,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 806 treesize of output 593 [2024-11-12 12:41:27,053 INFO L349 Elim1Store]: treesize reduction 41, result has 58.2 percent of original size [2024-11-12 12:41:27,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 575 treesize of output 519 [2024-11-12 12:41:27,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:41:27,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 507 treesize of output 505 [2024-11-12 12:41:27,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:41:27,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 455 treesize of output 568 [2024-11-12 12:41:27,483 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:27,485 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:27,511 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:27,588 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:27,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:27,722 INFO L224 Elim1Store]: Index analysis took 240 ms [2024-11-12 12:41:27,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:27,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:27,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:27,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:27,868 INFO L349 Elim1Store]: treesize reduction 275, result has 0.4 percent of original size [2024-11-12 12:41:27,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 45 [2024-11-12 12:41:27,919 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:27,922 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:27,971 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:28,108 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:28,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:28,395 INFO L224 Elim1Store]: Index analysis took 478 ms [2024-11-12 12:41:28,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:28,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:28,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:28,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:28,634 INFO L349 Elim1Store]: treesize reduction 275, result has 0.4 percent of original size [2024-11-12 12:41:28,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 165 treesize of output 45 [2024-11-12 12:41:28,896 INFO L349 Elim1Store]: treesize reduction 268, result has 0.4 percent of original size [2024-11-12 12:41:28,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 6610 treesize of output 6500 [2024-11-12 12:41:29,012 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,013 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,013 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,014 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 28 [2024-11-12 12:41:29,022 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,023 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,023 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,024 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 134 [2024-11-12 12:41:29,249 INFO L349 Elim1Store]: treesize reduction 56, result has 42.9 percent of original size [2024-11-12 12:41:29,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 804 treesize of output 591 [2024-11-12 12:41:29,330 INFO L349 Elim1Store]: treesize reduction 41, result has 58.2 percent of original size [2024-11-12 12:41:29,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 574 treesize of output 518 [2024-11-12 12:41:29,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:41:29,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 506 treesize of output 504 [2024-11-12 12:41:29,369 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,370 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,370 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,373 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,374 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,374 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,375 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,379 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,383 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,384 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:41:29,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 24 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 455 treesize of output 568 [2024-11-12 12:41:29,554 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,554 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,557 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,558 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,558 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,559 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,560 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,560 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,562 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,563 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,563 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,564 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,564 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:29,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:29,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:29,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:29,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:29,599 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-11-12 12:41:29,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 165 treesize of output 45 [2024-11-12 12:41:29,766 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,767 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,812 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,813 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,813 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,814 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,815 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,815 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,820 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,821 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,821 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,822 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:29,823 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:30,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:30,133 INFO L224 Elim1Store]: Index analysis took 451 ms [2024-11-12 12:41:30,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:30,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:30,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:30,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 12:41:30,223 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2024-11-12 12:41:30,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 165 treesize of output 45 [2024-11-12 12:41:30,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:30,527 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:30,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 14901 treesize of output 14838 [2024-11-12 12:41:31,737 INFO L349 Elim1Store]: treesize reduction 97, result has 1.0 percent of original size [2024-11-12 12:41:31,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 806 treesize of output 1 [2024-11-12 12:41:31,890 INFO L349 Elim1Store]: treesize reduction 56, result has 42.9 percent of original size [2024-11-12 12:41:31,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 806 treesize of output 593 [2024-11-12 12:41:32,314 INFO L349 Elim1Store]: treesize reduction 41, result has 58.2 percent of original size [2024-11-12 12:41:32,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 575 treesize of output 519 [2024-11-12 12:41:32,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:41:32,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 507 treesize of output 505 [2024-11-12 12:41:32,349 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,349 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,350 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,354 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,354 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,406 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:41:32,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 27 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 455 treesize of output 568 [2024-11-12 12:41:32,913 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,913 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,914 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 187 [2024-11-12 12:41:32,941 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,942 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,942 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,942 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,965 INFO L349 Elim1Store]: treesize reduction 268, result has 0.4 percent of original size [2024-11-12 12:41:32,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 211 treesize of output 1 [2024-11-12 12:41:32,978 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,979 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,979 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:41:32,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 2581 treesize of output 2540