./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-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 e53c8de1752bcaae88365f4089aa38090949baac13984623f5e7e3707a7b4c63 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:15:12,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:15:12,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:15:12,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:15:12,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:15:12,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:15:12,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:15:12,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:15:12,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:15:12,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:15:12,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:15:12,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:15:12,620 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:15:12,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:15:12,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:15:12,625 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:15:12,625 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:15:12,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:15:12,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:15:12,626 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:15:12,626 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:15:12,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:15:12,627 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:15:12,628 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:15:12,629 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:15:12,629 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:15:12,629 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:15:12,629 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:15:12,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:15:12,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:15:12,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:15:12,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:15:12,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:15:12,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:15:12,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:15:12,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:15:12,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:15:12,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:15:12,632 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:15:12,632 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:15:12,632 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:15:12,635 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 -> e53c8de1752bcaae88365f4089aa38090949baac13984623f5e7e3707a7b4c63 [2024-10-14 17:15:12,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:15:12,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:15:12,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:15:12,944 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:15:12,944 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:15:12,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2024-10-14 17:15:14,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:15:14,694 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:15:14,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2024-10-14 17:15:14,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb751bb10/bba3b20575264931bf635aa7fdd8d4d4/FLAG067328b60 [2024-10-14 17:15:14,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb751bb10/bba3b20575264931bf635aa7fdd8d4d4 [2024-10-14 17:15:14,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:15:14,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:15:14,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:15:14,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:15:14,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:15:14,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:15:14" (1/1) ... [2024-10-14 17:15:14,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54aaa90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:14, skipping insertion in model container [2024-10-14 17:15:14,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:15:14" (1/1) ... [2024-10-14 17:15:14,757 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:15:14,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:15:14,959 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:15:14,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:15:15,020 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:15:15,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:15 WrapperNode [2024-10-14 17:15:15,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:15:15,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:15:15,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:15:15,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:15:15,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:15" (1/1) ... [2024-10-14 17:15:15,039 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:15" (1/1) ... [2024-10-14 17:15:15,067 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 147 [2024-10-14 17:15:15,068 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:15:15,069 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:15:15,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:15:15,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:15:15,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:15" (1/1) ... [2024-10-14 17:15:15,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:15" (1/1) ... [2024-10-14 17:15:15,087 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:15" (1/1) ... [2024-10-14 17:15:15,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:15" (1/1) ... [2024-10-14 17:15:15,103 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:15" (1/1) ... [2024-10-14 17:15:15,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:15" (1/1) ... [2024-10-14 17:15:15,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:15" (1/1) ... [2024-10-14 17:15:15,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:15" (1/1) ... [2024-10-14 17:15:15,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:15:15,124 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:15:15,125 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:15:15,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:15:15,126 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:15" (1/1) ... [2024-10-14 17:15:15,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:15:15,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:15:15,159 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-10-14 17:15:15,162 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-10-14 17:15:15,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:15:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 17:15:15,206 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 17:15:15,206 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 17:15:15,206 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 17:15:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-14 17:15:15,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-14 17:15:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:15:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 17:15:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-14 17:15:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-14 17:15:15,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:15:15,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:15:15,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:15:15,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 17:15:15,211 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:15:15,304 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:15:15,306 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:15:15,810 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:15:15,811 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:15:15,990 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:15:15,991 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-14 17:15:15,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:15 BoogieIcfgContainer [2024-10-14 17:15:15,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:15:15,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:15:15,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:15:15,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:15:15,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:15:14" (1/3) ... [2024-10-14 17:15:15,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d15f3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:15:15, skipping insertion in model container [2024-10-14 17:15:15,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:15:15" (2/3) ... [2024-10-14 17:15:16,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d15f3ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:15:16, skipping insertion in model container [2024-10-14 17:15:16,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:15:15" (3/3) ... [2024-10-14 17:15:16,002 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2024-10-14 17:15:16,019 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:15:16,020 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-10-14 17:15:16,021 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:15:16,116 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-14 17:15:16,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 267 transitions, 555 flow [2024-10-14 17:15:16,257 INFO L124 PetriNetUnfolderBase]: 16/264 cut-off events. [2024-10-14 17:15:16,257 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 17:15:16,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 264 events. 16/264 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 375 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 212. Up to 2 conditions per place. [2024-10-14 17:15:16,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 267 transitions, 555 flow [2024-10-14 17:15:16,279 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 247 transitions, 512 flow [2024-10-14 17:15:16,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:15:16,301 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;@560222a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:15:16,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-10-14 17:15:16,309 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:15:16,310 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-10-14 17:15:16,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:15:16,310 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:16,311 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:16,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:16,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:16,316 INFO L85 PathProgramCache]: Analyzing trace with hash 510647353, now seen corresponding path program 1 times [2024-10-14 17:15:16,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:16,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935587353] [2024-10-14 17:15:16,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:16,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:16,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:16,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:16,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935587353] [2024-10-14 17:15:16,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935587353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:16,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:16,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:16,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682400528] [2024-10-14 17:15:16,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:16,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:16,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:16,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:16,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:16,606 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 267 [2024-10-14 17:15:16,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 247 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:16,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:16,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 267 [2024-10-14 17:15:16,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:16,854 INFO L124 PetriNetUnfolderBase]: 110/714 cut-off events. [2024-10-14 17:15:16,854 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-10-14 17:15:16,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 714 events. 110/714 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3768 event pairs, 71 based on Foata normal form. 6/609 useless extension candidates. Maximal degree in co-relation 712. Up to 174 conditions per place. [2024-10-14 17:15:16,865 INFO L140 encePairwiseOnDemand]: 245/267 looper letters, 19 selfloop transitions, 2 changer transitions 4/227 dead transitions. [2024-10-14 17:15:16,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 227 transitions, 514 flow [2024-10-14 17:15:16,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:16,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2024-10-14 17:15:16,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8863920099875156 [2024-10-14 17:15:16,888 INFO L175 Difference]: Start difference. First operand has 242 places, 247 transitions, 512 flow. Second operand 3 states and 710 transitions. [2024-10-14 17:15:16,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 227 transitions, 514 flow [2024-10-14 17:15:16,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 227 transitions, 502 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 17:15:16,899 INFO L231 Difference]: Finished difference. Result has 227 places, 223 transitions, 456 flow [2024-10-14 17:15:16,902 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=227, PETRI_TRANSITIONS=223} [2024-10-14 17:15:16,906 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -15 predicate places. [2024-10-14 17:15:16,907 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 223 transitions, 456 flow [2024-10-14 17:15:16,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:16,908 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:16,908 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:16,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:15:16,909 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:16,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:16,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1867613618, now seen corresponding path program 1 times [2024-10-14 17:15:16,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:16,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118102946] [2024-10-14 17:15:16,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:16,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:16,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:16,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118102946] [2024-10-14 17:15:16,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118102946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:16,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:16,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:16,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485926114] [2024-10-14 17:15:16,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:16,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:16,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:16,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:16,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:17,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 267 [2024-10-14 17:15:17,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 223 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:17,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:17,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 267 [2024-10-14 17:15:17,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:17,258 INFO L124 PetriNetUnfolderBase]: 262/953 cut-off events. [2024-10-14 17:15:17,260 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-10-14 17:15:17,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1343 conditions, 953 events. 262/953 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5407 event pairs, 164 based on Foata normal form. 1/826 useless extension candidates. Maximal degree in co-relation 1312. Up to 365 conditions per place. [2024-10-14 17:15:17,268 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 20 selfloop transitions, 1 changer transitions 2/217 dead transitions. [2024-10-14 17:15:17,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 217 transitions, 488 flow [2024-10-14 17:15:17,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2024-10-14 17:15:17,277 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8476903870162297 [2024-10-14 17:15:17,277 INFO L175 Difference]: Start difference. First operand has 227 places, 223 transitions, 456 flow. Second operand 3 states and 679 transitions. [2024-10-14 17:15:17,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 217 transitions, 488 flow [2024-10-14 17:15:17,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 217 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:17,284 INFO L231 Difference]: Finished difference. Result has 217 places, 215 transitions, 438 flow [2024-10-14 17:15:17,287 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=217, PETRI_TRANSITIONS=215} [2024-10-14 17:15:17,288 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -25 predicate places. [2024-10-14 17:15:17,288 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 215 transitions, 438 flow [2024-10-14 17:15:17,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:17,289 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:17,289 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:17,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:15:17,289 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:17,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:17,290 INFO L85 PathProgramCache]: Analyzing trace with hash -75217045, now seen corresponding path program 1 times [2024-10-14 17:15:17,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:17,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885315170] [2024-10-14 17:15:17,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:17,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:17,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:17,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:17,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885315170] [2024-10-14 17:15:17,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885315170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:17,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:17,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:15:17,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946571111] [2024-10-14 17:15:17,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:17,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:15:17,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:17,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:15:17,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:15:18,222 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 267 [2024-10-14 17:15:18,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 215 transitions, 438 flow. Second operand has 6 states, 6 states have (on average 205.5) internal successors, (1233), 6 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:18,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:18,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 267 [2024-10-14 17:15:18,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:18,428 INFO L124 PetriNetUnfolderBase]: 146/871 cut-off events. [2024-10-14 17:15:18,428 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-14 17:15:18,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 871 events. 146/871 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4903 event pairs, 92 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 1107. Up to 232 conditions per place. [2024-10-14 17:15:18,438 INFO L140 encePairwiseOnDemand]: 255/267 looper letters, 30 selfloop transitions, 10 changer transitions 0/213 dead transitions. [2024-10-14 17:15:18,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 213 transitions, 514 flow [2024-10-14 17:15:18,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:15:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:15:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1266 transitions. [2024-10-14 17:15:18,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7902621722846442 [2024-10-14 17:15:18,442 INFO L175 Difference]: Start difference. First operand has 217 places, 215 transitions, 438 flow. Second operand 6 states and 1266 transitions. [2024-10-14 17:15:18,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 213 transitions, 514 flow [2024-10-14 17:15:18,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 213 transitions, 513 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:15:18,448 INFO L231 Difference]: Finished difference. Result has 217 places, 213 transitions, 453 flow [2024-10-14 17:15:18,449 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=453, PETRI_PLACES=217, PETRI_TRANSITIONS=213} [2024-10-14 17:15:18,450 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -25 predicate places. [2024-10-14 17:15:18,451 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 213 transitions, 453 flow [2024-10-14 17:15:18,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.5) internal successors, (1233), 6 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:18,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:18,452 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:18,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:15:18,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:18,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:18,454 INFO L85 PathProgramCache]: Analyzing trace with hash -518200873, now seen corresponding path program 1 times [2024-10-14 17:15:18,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:18,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709419601] [2024-10-14 17:15:18,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:18,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:18,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:18,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709419601] [2024-10-14 17:15:18,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709419601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:18,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:18,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:18,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627554522] [2024-10-14 17:15:18,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:18,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:18,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:18,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:18,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:18,512 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 267 [2024-10-14 17:15:18,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 213 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:18,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:18,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 267 [2024-10-14 17:15:18,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:18,588 INFO L124 PetriNetUnfolderBase]: 59/395 cut-off events. [2024-10-14 17:15:18,589 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-14 17:15:18,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 395 events. 59/395 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1412 event pairs, 38 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 481. Up to 93 conditions per place. [2024-10-14 17:15:18,593 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 14 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2024-10-14 17:15:18,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 212 transitions, 483 flow [2024-10-14 17:15:18,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2024-10-14 17:15:18,595 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8751560549313359 [2024-10-14 17:15:18,595 INFO L175 Difference]: Start difference. First operand has 217 places, 213 transitions, 453 flow. Second operand 3 states and 701 transitions. [2024-10-14 17:15:18,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 212 transitions, 483 flow [2024-10-14 17:15:18,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 212 transitions, 463 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:15:18,600 INFO L231 Difference]: Finished difference. Result has 213 places, 212 transitions, 435 flow [2024-10-14 17:15:18,600 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=213, PETRI_TRANSITIONS=212} [2024-10-14 17:15:18,601 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -29 predicate places. [2024-10-14 17:15:18,601 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 212 transitions, 435 flow [2024-10-14 17:15:18,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:18,602 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:18,602 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:18,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:15:18,603 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:18,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:18,603 INFO L85 PathProgramCache]: Analyzing trace with hash 20922305, now seen corresponding path program 1 times [2024-10-14 17:15:18,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:18,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288122053] [2024-10-14 17:15:18,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:18,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:18,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:18,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288122053] [2024-10-14 17:15:18,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288122053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:18,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:18,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:18,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799566970] [2024-10-14 17:15:18,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:18,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:18,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:18,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:18,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:18,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 267 [2024-10-14 17:15:18,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 212 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:18,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:18,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 267 [2024-10-14 17:15:18,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:18,727 INFO L124 PetriNetUnfolderBase]: 35/296 cut-off events. [2024-10-14 17:15:18,728 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-14 17:15:18,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 296 events. 35/296 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 748 event pairs, 20 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 336. Up to 59 conditions per place. [2024-10-14 17:15:18,730 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 13 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-10-14 17:15:18,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 211 transitions, 463 flow [2024-10-14 17:15:18,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2024-10-14 17:15:18,732 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776529338327091 [2024-10-14 17:15:18,733 INFO L175 Difference]: Start difference. First operand has 213 places, 212 transitions, 435 flow. Second operand 3 states and 703 transitions. [2024-10-14 17:15:18,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 211 transitions, 463 flow [2024-10-14 17:15:18,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 211 transitions, 459 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:18,737 INFO L231 Difference]: Finished difference. Result has 212 places, 211 transitions, 433 flow [2024-10-14 17:15:18,738 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=212, PETRI_TRANSITIONS=211} [2024-10-14 17:15:18,739 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -30 predicate places. [2024-10-14 17:15:18,740 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 211 transitions, 433 flow [2024-10-14 17:15:18,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:18,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:18,741 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:18,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:15:18,742 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:18,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:18,743 INFO L85 PathProgramCache]: Analyzing trace with hash -987699900, now seen corresponding path program 1 times [2024-10-14 17:15:18,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:18,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803754233] [2024-10-14 17:15:18,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:18,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:18,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:18,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803754233] [2024-10-14 17:15:18,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803754233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:18,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:18,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:18,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298563029] [2024-10-14 17:15:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:18,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:18,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:18,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:18,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:18,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 267 [2024-10-14 17:15:18,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 211 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:18,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:18,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 267 [2024-10-14 17:15:18,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:18,942 INFO L124 PetriNetUnfolderBase]: 120/669 cut-off events. [2024-10-14 17:15:18,942 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-14 17:15:18,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 669 events. 120/669 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3254 event pairs, 38 based on Foata normal form. 1/605 useless extension candidates. Maximal degree in co-relation 842. Up to 100 conditions per place. [2024-10-14 17:15:18,948 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 17 selfloop transitions, 2 changer transitions 2/215 dead transitions. [2024-10-14 17:15:18,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 215 transitions, 483 flow [2024-10-14 17:15:18,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:18,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions. [2024-10-14 17:15:18,951 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.885143570536829 [2024-10-14 17:15:18,951 INFO L175 Difference]: Start difference. First operand has 212 places, 211 transitions, 433 flow. Second operand 3 states and 709 transitions. [2024-10-14 17:15:18,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 215 transitions, 483 flow [2024-10-14 17:15:18,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 215 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:18,955 INFO L231 Difference]: Finished difference. Result has 210 places, 207 transitions, 425 flow [2024-10-14 17:15:18,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=210, PETRI_TRANSITIONS=207} [2024-10-14 17:15:18,956 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -32 predicate places. [2024-10-14 17:15:18,956 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 207 transitions, 425 flow [2024-10-14 17:15:18,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:18,957 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:18,957 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:18,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:15:18,958 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:18,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:18,958 INFO L85 PathProgramCache]: Analyzing trace with hash 8192390, now seen corresponding path program 1 times [2024-10-14 17:15:18,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:18,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556965486] [2024-10-14 17:15:18,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:18,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:19,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:19,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556965486] [2024-10-14 17:15:19,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556965486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:19,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:19,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:19,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859260076] [2024-10-14 17:15:19,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:19,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:19,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:19,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:19,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:19,015 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 267 [2024-10-14 17:15:19,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 207 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:19,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:19,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 267 [2024-10-14 17:15:19,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:19,130 INFO L124 PetriNetUnfolderBase]: 104/641 cut-off events. [2024-10-14 17:15:19,131 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-10-14 17:15:19,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 641 events. 104/641 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3187 event pairs, 12 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 801. Up to 143 conditions per place. [2024-10-14 17:15:19,136 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 20 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2024-10-14 17:15:19,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 215 transitions, 490 flow [2024-10-14 17:15:19,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:19,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-10-14 17:15:19,139 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8976279650436954 [2024-10-14 17:15:19,139 INFO L175 Difference]: Start difference. First operand has 210 places, 207 transitions, 425 flow. Second operand 3 states and 719 transitions. [2024-10-14 17:15:19,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 215 transitions, 490 flow [2024-10-14 17:15:19,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 215 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:19,145 INFO L231 Difference]: Finished difference. Result has 208 places, 208 transitions, 433 flow [2024-10-14 17:15:19,146 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=208, PETRI_TRANSITIONS=208} [2024-10-14 17:15:19,147 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -34 predicate places. [2024-10-14 17:15:19,148 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 208 transitions, 433 flow [2024-10-14 17:15:19,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:19,148 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:19,149 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:19,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:15:19,149 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:19,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:19,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1371360790, now seen corresponding path program 1 times [2024-10-14 17:15:19,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:19,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430191108] [2024-10-14 17:15:19,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:19,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:19,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:19,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:19,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430191108] [2024-10-14 17:15:19,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430191108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:19,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:19,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:15:19,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679158250] [2024-10-14 17:15:19,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:19,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:15:19,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:19,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:15:19,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:15:19,570 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 267 [2024-10-14 17:15:19,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 208 transitions, 433 flow. Second operand has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:19,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:19,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 267 [2024-10-14 17:15:19,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:19,914 INFO L124 PetriNetUnfolderBase]: 258/1319 cut-off events. [2024-10-14 17:15:19,914 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2024-10-14 17:15:19,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 1319 events. 258/1319 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 7489 event pairs, 150 based on Foata normal form. 13/1261 useless extension candidates. Maximal degree in co-relation 1917. Up to 274 conditions per place. [2024-10-14 17:15:19,926 INFO L140 encePairwiseOnDemand]: 246/267 looper letters, 46 selfloop transitions, 28 changer transitions 0/247 dead transitions. [2024-10-14 17:15:19,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 247 transitions, 677 flow [2024-10-14 17:15:19,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:15:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-14 17:15:19,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2192 transitions. [2024-10-14 17:15:19,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8209737827715355 [2024-10-14 17:15:19,931 INFO L175 Difference]: Start difference. First operand has 208 places, 208 transitions, 433 flow. Second operand 10 states and 2192 transitions. [2024-10-14 17:15:19,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 247 transitions, 677 flow [2024-10-14 17:15:19,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 247 transitions, 677 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:15:19,936 INFO L231 Difference]: Finished difference. Result has 221 places, 224 transitions, 562 flow [2024-10-14 17:15:19,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=562, PETRI_PLACES=221, PETRI_TRANSITIONS=224} [2024-10-14 17:15:19,939 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -21 predicate places. [2024-10-14 17:15:19,939 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 224 transitions, 562 flow [2024-10-14 17:15:19,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:19,941 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:19,941 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 17:15:19,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:15:19,943 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:19,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:19,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1479561612, now seen corresponding path program 1 times [2024-10-14 17:15:19,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:19,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223047173] [2024-10-14 17:15:19,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:19,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:15:20,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:20,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223047173] [2024-10-14 17:15:20,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223047173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:20,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:20,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:15:20,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291577113] [2024-10-14 17:15:20,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:20,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:15:20,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:20,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:15:20,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:15:20,578 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 267 [2024-10-14 17:15:20,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 224 transitions, 562 flow. Second operand has 6 states, 6 states have (on average 219.83333333333334) internal successors, (1319), 6 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:20,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:20,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 267 [2024-10-14 17:15:20,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:21,066 INFO L124 PetriNetUnfolderBase]: 408/1670 cut-off events. [2024-10-14 17:15:21,067 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2024-10-14 17:15:21,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2750 conditions, 1670 events. 408/1670 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 10595 event pairs, 176 based on Foata normal form. 0/1579 useless extension candidates. Maximal degree in co-relation 2711. Up to 517 conditions per place. [2024-10-14 17:15:21,080 INFO L140 encePairwiseOnDemand]: 259/267 looper letters, 51 selfloop transitions, 10 changer transitions 0/253 dead transitions. [2024-10-14 17:15:21,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 253 transitions, 758 flow [2024-10-14 17:15:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:15:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:15:21,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1361 transitions. [2024-10-14 17:15:21,084 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8495630461922596 [2024-10-14 17:15:21,084 INFO L175 Difference]: Start difference. First operand has 221 places, 224 transitions, 562 flow. Second operand 6 states and 1361 transitions. [2024-10-14 17:15:21,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 253 transitions, 758 flow [2024-10-14 17:15:21,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 253 transitions, 758 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:15:21,092 INFO L231 Difference]: Finished difference. Result has 231 places, 233 transitions, 642 flow [2024-10-14 17:15:21,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=642, PETRI_PLACES=231, PETRI_TRANSITIONS=233} [2024-10-14 17:15:21,094 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -11 predicate places. [2024-10-14 17:15:21,094 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 233 transitions, 642 flow [2024-10-14 17:15:21,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.83333333333334) internal successors, (1319), 6 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:21,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:21,096 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:21,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:15:21,096 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:21,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:21,097 INFO L85 PathProgramCache]: Analyzing trace with hash 828749171, now seen corresponding path program 1 times [2024-10-14 17:15:21,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:21,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588323851] [2024-10-14 17:15:21,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:21,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:21,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:15:21,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:21,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588323851] [2024-10-14 17:15:21,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588323851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:21,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:21,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:21,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569243219] [2024-10-14 17:15:21,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:21,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:21,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:21,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:21,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:21,149 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 267 [2024-10-14 17:15:21,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 233 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:21,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:21,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 267 [2024-10-14 17:15:21,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:21,293 INFO L124 PetriNetUnfolderBase]: 163/917 cut-off events. [2024-10-14 17:15:21,293 INFO L125 PetriNetUnfolderBase]: For 437/479 co-relation queries the response was YES. [2024-10-14 17:15:21,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 917 events. 163/917 cut-off events. For 437/479 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4690 event pairs, 58 based on Foata normal form. 4/872 useless extension candidates. Maximal degree in co-relation 1511. Up to 221 conditions per place. [2024-10-14 17:15:21,302 INFO L140 encePairwiseOnDemand]: 265/267 looper letters, 14 selfloop transitions, 0 changer transitions 16/232 dead transitions. [2024-10-14 17:15:21,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 232 transitions, 672 flow [2024-10-14 17:15:21,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:21,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2024-10-14 17:15:21,304 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8876404494382022 [2024-10-14 17:15:21,304 INFO L175 Difference]: Start difference. First operand has 231 places, 233 transitions, 642 flow. Second operand 3 states and 711 transitions. [2024-10-14 17:15:21,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 232 transitions, 672 flow [2024-10-14 17:15:21,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 232 transitions, 664 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-10-14 17:15:21,310 INFO L231 Difference]: Finished difference. Result has 232 places, 216 transitions, 556 flow [2024-10-14 17:15:21,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=232, PETRI_TRANSITIONS=216} [2024-10-14 17:15:21,312 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -10 predicate places. [2024-10-14 17:15:21,312 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 216 transitions, 556 flow [2024-10-14 17:15:21,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:21,313 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:21,313 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:21,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:15:21,313 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:21,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:21,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1005685385, now seen corresponding path program 1 times [2024-10-14 17:15:21,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:21,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101814771] [2024-10-14 17:15:21,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:21,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:15:21,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:21,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101814771] [2024-10-14 17:15:21,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101814771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:21,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:21,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:15:21,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030536319] [2024-10-14 17:15:21,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:21,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:15:21,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:21,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:15:21,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:15:21,382 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 267 [2024-10-14 17:15:21,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 216 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:21,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:21,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 267 [2024-10-14 17:15:21,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:21,673 INFO L124 PetriNetUnfolderBase]: 356/1390 cut-off events. [2024-10-14 17:15:21,673 INFO L125 PetriNetUnfolderBase]: For 478/482 co-relation queries the response was YES. [2024-10-14 17:15:21,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 1390 events. 356/1390 cut-off events. For 478/482 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 9230 event pairs, 152 based on Foata normal form. 0/1319 useless extension candidates. Maximal degree in co-relation 2441. Up to 391 conditions per place. [2024-10-14 17:15:21,688 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 24 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-10-14 17:15:21,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 222 transitions, 630 flow [2024-10-14 17:15:21,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:15:21,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:15:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 708 transitions. [2024-10-14 17:15:21,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8838951310861424 [2024-10-14 17:15:21,691 INFO L175 Difference]: Start difference. First operand has 232 places, 216 transitions, 556 flow. Second operand 3 states and 708 transitions. [2024-10-14 17:15:21,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 222 transitions, 630 flow [2024-10-14 17:15:21,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 222 transitions, 592 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-10-14 17:15:21,697 INFO L231 Difference]: Finished difference. Result has 219 places, 215 transitions, 520 flow [2024-10-14 17:15:21,697 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=219, PETRI_TRANSITIONS=215} [2024-10-14 17:15:21,698 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -23 predicate places. [2024-10-14 17:15:21,698 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 520 flow [2024-10-14 17:15:21,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:21,699 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:21,699 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:21,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:15:21,699 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:21,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:21,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1866061374, now seen corresponding path program 1 times [2024-10-14 17:15:21,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:21,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214224549] [2024-10-14 17:15:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:21,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:15:22,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:22,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214224549] [2024-10-14 17:15:22,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214224549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:22,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:22,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 17:15:22,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361231728] [2024-10-14 17:15:22,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:22,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 17:15:22,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:22,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 17:15:22,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-14 17:15:23,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 267 [2024-10-14 17:15:23,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 215 transitions, 520 flow. Second operand has 15 states, 15 states have (on average 198.46666666666667) internal successors, (2977), 15 states have internal predecessors, (2977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:23,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:23,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 267 [2024-10-14 17:15:23,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:24,714 INFO L124 PetriNetUnfolderBase]: 975/3353 cut-off events. [2024-10-14 17:15:24,715 INFO L125 PetriNetUnfolderBase]: For 1066/1168 co-relation queries the response was YES. [2024-10-14 17:15:24,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6308 conditions, 3353 events. 975/3353 cut-off events. For 1066/1168 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 27959 event pairs, 221 based on Foata normal form. 52/3183 useless extension candidates. Maximal degree in co-relation 6297. Up to 583 conditions per place. [2024-10-14 17:15:24,746 INFO L140 encePairwiseOnDemand]: 241/267 looper letters, 81 selfloop transitions, 44 changer transitions 0/285 dead transitions. [2024-10-14 17:15:24,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 285 transitions, 1030 flow [2024-10-14 17:15:24,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 17:15:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-14 17:15:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4804 transitions. [2024-10-14 17:15:24,756 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7496878901373284 [2024-10-14 17:15:24,757 INFO L175 Difference]: Start difference. First operand has 219 places, 215 transitions, 520 flow. Second operand 24 states and 4804 transitions. [2024-10-14 17:15:24,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 285 transitions, 1030 flow [2024-10-14 17:15:24,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 285 transitions, 1026 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:15:24,765 INFO L231 Difference]: Finished difference. Result has 245 places, 240 transitions, 792 flow [2024-10-14 17:15:24,766 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=792, PETRI_PLACES=245, PETRI_TRANSITIONS=240} [2024-10-14 17:15:24,766 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 3 predicate places. [2024-10-14 17:15:24,767 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 240 transitions, 792 flow [2024-10-14 17:15:24,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 198.46666666666667) internal successors, (2977), 15 states have internal predecessors, (2977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:24,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:24,769 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:15:24,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:15:24,770 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:24,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:24,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1913155474, now seen corresponding path program 2 times [2024-10-14 17:15:24,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:24,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479985530] [2024-10-14 17:15:24,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:24,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:15:25,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:25,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479985530] [2024-10-14 17:15:25,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479985530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:15:25,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:15:25,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 17:15:25,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167070367] [2024-10-14 17:15:25,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:15:25,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 17:15:25,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:25,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 17:15:25,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-14 17:15:26,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 267 [2024-10-14 17:15:26,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 240 transitions, 792 flow. Second operand has 15 states, 15 states have (on average 198.46666666666667) internal successors, (2977), 15 states have internal predecessors, (2977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:26,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:26,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 267 [2024-10-14 17:15:26,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:27,893 INFO L124 PetriNetUnfolderBase]: 1458/4674 cut-off events. [2024-10-14 17:15:27,893 INFO L125 PetriNetUnfolderBase]: For 5865/6167 co-relation queries the response was YES. [2024-10-14 17:15:27,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10890 conditions, 4674 events. 1458/4674 cut-off events. For 5865/6167 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 41797 event pairs, 389 based on Foata normal form. 170/4583 useless extension candidates. Maximal degree in co-relation 10874. Up to 1033 conditions per place. [2024-10-14 17:15:27,948 INFO L140 encePairwiseOnDemand]: 241/267 looper letters, 85 selfloop transitions, 65 changer transitions 0/310 dead transitions. [2024-10-14 17:15:27,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 310 transitions, 1488 flow [2024-10-14 17:15:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 17:15:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-14 17:15:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4804 transitions. [2024-10-14 17:15:27,961 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7496878901373284 [2024-10-14 17:15:27,961 INFO L175 Difference]: Start difference. First operand has 245 places, 240 transitions, 792 flow. Second operand 24 states and 4804 transitions. [2024-10-14 17:15:27,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 310 transitions, 1488 flow [2024-10-14 17:15:27,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 310 transitions, 1455 flow, removed 0 selfloop flow, removed 17 redundant places. [2024-10-14 17:15:27,980 INFO L231 Difference]: Finished difference. Result has 256 places, 272 transitions, 1224 flow [2024-10-14 17:15:27,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1224, PETRI_PLACES=256, PETRI_TRANSITIONS=272} [2024-10-14 17:15:27,982 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 14 predicate places. [2024-10-14 17:15:27,982 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 272 transitions, 1224 flow [2024-10-14 17:15:27,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 198.46666666666667) internal successors, (2977), 15 states have internal predecessors, (2977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:27,984 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:27,984 INFO L204 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] [2024-10-14 17:15:27,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:15:27,985 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:27,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1407441473, now seen corresponding path program 1 times [2024-10-14 17:15:27,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:27,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249981872] [2024-10-14 17:15:27,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:27,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:15:28,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:28,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249981872] [2024-10-14 17:15:28,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249981872] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:15:28,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978349004] [2024-10-14 17:15:28,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:28,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:15:28,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:15:28,295 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-10-14 17:15:28,297 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-10-14 17:15:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:28,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 17:15:28,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:15:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:15:28,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:15:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:15:29,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978349004] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:15:29,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:15:29,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-10-14 17:15:29,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354928345] [2024-10-14 17:15:29,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:15:29,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 17:15:29,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:29,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 17:15:29,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-10-14 17:15:30,056 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 267 [2024-10-14 17:15:30,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 272 transitions, 1224 flow. Second operand has 24 states, 24 states have (on average 205.75) internal successors, (4938), 24 states have internal predecessors, (4938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:30,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:30,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 267 [2024-10-14 17:15:30,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:32,073 INFO L124 PetriNetUnfolderBase]: 2502/7426 cut-off events. [2024-10-14 17:15:32,074 INFO L125 PetriNetUnfolderBase]: For 11997/12868 co-relation queries the response was YES. [2024-10-14 17:15:32,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18804 conditions, 7426 events. 2502/7426 cut-off events. For 11997/12868 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 70468 event pairs, 1113 based on Foata normal form. 208/7199 useless extension candidates. Maximal degree in co-relation 18783. Up to 2249 conditions per place. [2024-10-14 17:15:32,189 INFO L140 encePairwiseOnDemand]: 236/267 looper letters, 117 selfloop transitions, 71 changer transitions 1/383 dead transitions. [2024-10-14 17:15:32,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 383 transitions, 2144 flow [2024-10-14 17:15:32,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 17:15:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-10-14 17:15:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4794 transitions. [2024-10-14 17:15:32,203 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7806546165119688 [2024-10-14 17:15:32,203 INFO L175 Difference]: Start difference. First operand has 256 places, 272 transitions, 1224 flow. Second operand 23 states and 4794 transitions. [2024-10-14 17:15:32,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 383 transitions, 2144 flow [2024-10-14 17:15:32,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 383 transitions, 2055 flow, removed 26 selfloop flow, removed 17 redundant places. [2024-10-14 17:15:32,246 INFO L231 Difference]: Finished difference. Result has 274 places, 319 transitions, 1668 flow [2024-10-14 17:15:32,247 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1668, PETRI_PLACES=274, PETRI_TRANSITIONS=319} [2024-10-14 17:15:32,248 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 32 predicate places. [2024-10-14 17:15:32,248 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 319 transitions, 1668 flow [2024-10-14 17:15:32,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 205.75) internal successors, (4938), 24 states have internal predecessors, (4938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:32,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:32,250 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-10-14 17:15:32,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 17:15:32,454 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,SelfDestructingSolverStorable13 [2024-10-14 17:15:32,455 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:32,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:32,456 INFO L85 PathProgramCache]: Analyzing trace with hash -863254300, now seen corresponding path program 1 times [2024-10-14 17:15:32,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:32,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427176203] [2024-10-14 17:15:32,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:32,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:15:32,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:32,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427176203] [2024-10-14 17:15:32,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427176203] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:15:32,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132306303] [2024-10-14 17:15:32,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:32,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:15:32,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:15:32,807 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-10-14 17:15:32,809 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-10-14 17:15:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:32,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 17:15:32,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:15:33,415 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:15:33,415 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:15:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:15:33,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132306303] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:15:33,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:15:33,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-10-14 17:15:33,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365155215] [2024-10-14 17:15:33,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:15:33,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-14 17:15:33,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:15:33,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-14 17:15:33,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-10-14 17:15:34,862 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 267 [2024-10-14 17:15:34,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 319 transitions, 1668 flow. Second operand has 24 states, 24 states have (on average 205.5) internal successors, (4932), 24 states have internal predecessors, (4932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:34,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:15:34,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 267 [2024-10-14 17:15:34,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:15:36,745 INFO L124 PetriNetUnfolderBase]: 2295/8330 cut-off events. [2024-10-14 17:15:36,745 INFO L125 PetriNetUnfolderBase]: For 14521/14707 co-relation queries the response was YES. [2024-10-14 17:15:36,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21209 conditions, 8330 events. 2295/8330 cut-off events. For 14521/14707 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 79861 event pairs, 805 based on Foata normal form. 89/7995 useless extension candidates. Maximal degree in co-relation 21175. Up to 1735 conditions per place. [2024-10-14 17:15:36,817 INFO L140 encePairwiseOnDemand]: 236/267 looper letters, 65 selfloop transitions, 33 changer transitions 119/411 dead transitions. [2024-10-14 17:15:36,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 411 transitions, 2576 flow [2024-10-14 17:15:36,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 17:15:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-10-14 17:15:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4806 transitions. [2024-10-14 17:15:36,823 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2024-10-14 17:15:36,823 INFO L175 Difference]: Start difference. First operand has 274 places, 319 transitions, 1668 flow. Second operand 23 states and 4806 transitions. [2024-10-14 17:15:36,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 411 transitions, 2576 flow [2024-10-14 17:15:37,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 411 transitions, 2550 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-10-14 17:15:37,030 INFO L231 Difference]: Finished difference. Result has 300 places, 280 transitions, 1405 flow [2024-10-14 17:15:37,031 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1405, PETRI_PLACES=300, PETRI_TRANSITIONS=280} [2024-10-14 17:15:37,032 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 58 predicate places. [2024-10-14 17:15:37,032 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 280 transitions, 1405 flow [2024-10-14 17:15:37,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 205.5) internal successors, (4932), 24 states have internal predecessors, (4932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:15:37,034 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:15:37,034 INFO L204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 17:15:37,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:15:37,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 17:15:37,236 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-14 17:15:37,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:15:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash 963910473, now seen corresponding path program 2 times [2024-10-14 17:15:37,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:15:37,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938324736] [2024-10-14 17:15:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:15:37,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:15:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:15:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-14 17:15:38,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:15:38,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938324736] [2024-10-14 17:15:38,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938324736] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:15:38,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514377061] [2024-10-14 17:15:38,914 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:15:38,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:15:38,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:15:38,916 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-10-14 17:15:38,919 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-10-14 17:15:39,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:15:39,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:15:39,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-14 17:15:39,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:15:39,125 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-10-14 17:15:39,637 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 17:15:39,638 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-10-14 17:15:40,323 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-10-14 17:15:40,384 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-10-14 17:15:40,460 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-10-14 17:15:40,534 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-10-14 17:15:40,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:15:40,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:15:40,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:15:40,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:15:40,694 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 91 [2024-10-14 17:15:40,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 60 [2024-10-14 17:15:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-14 17:15:44,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:15:47,999 INFO L349 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2024-10-14 17:15:48,000 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 82 treesize of output 118 [2024-10-14 17:15:48,011 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-10-14 17:15:48,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 134 treesize of output 55 [2024-10-14 17:15:48,019 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-10-14 17:15:48,042 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-10-14 17:15:48,043 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 81 treesize of output 1 [2024-10-14 17:15:48,069 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-10-14 17:15:48,069 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 82 treesize of output 1 [2024-10-14 17:15:48,086 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-10-14 17:15:48,086 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 82 treesize of output 1 [2024-10-14 17:16:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 4 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-14 17:16:17,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514377061] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:16:17,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:16:17,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 24] total 65 [2024-10-14 17:16:17,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640162464] [2024-10-14 17:16:17,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:16:17,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-14 17:16:17,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:16:17,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-14 17:16:17,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=3888, Unknown=32, NotChecked=0, Total=4290 [2024-10-14 17:16:21,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 17:16:26,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 17:16:30,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 17:16:34,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 17:16:38,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]