./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/pthread-race-challenges/per-thread-struct-tid.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:20:37,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:20:37,771 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:20:37,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:20:37,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:20:37,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:20:37,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:20:37,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:20:37,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:20:37,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:20:37,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:20:37,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:20:37,815 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:20:37,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:20:37,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:20:37,817 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:20:37,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:20:37,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:20:37,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:20:37,818 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:20:37,818 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:20:37,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:20:37,822 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:20:37,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:20:37,822 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:20:37,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:20:37,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:20:37,823 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:20:37,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:20:37,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:20:37,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:20:37,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:20:37,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:20:37,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:20:37,824 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:20:37,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:20:37,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:20:37,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:20:37,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:20:37,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:20:37,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:20:37,833 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-clean/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-clean/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 -> da100b5cb95d7325be7357bb16aa7526e66fa3d3a90ac0a0850ac9736c0f81ee [2024-10-11 17:20:38,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:20:38,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:20:38,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:20:38,086 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:20:38,086 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:20:38,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2024-10-11 17:20:39,360 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:20:39,610 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:20:39,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-struct-tid.i [2024-10-11 17:20:39,623 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/af21489c1/80b14a399d3c4c1da030414303767413/FLAGec520278a [2024-10-11 17:20:39,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/af21489c1/80b14a399d3c4c1da030414303767413 [2024-10-11 17:20:39,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:20:39,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:20:39,921 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:20:39,921 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:20:39,925 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:20:39,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:20:39" (1/1) ... [2024-10-11 17:20:39,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7e19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:39, skipping insertion in model container [2024-10-11 17:20:39,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:20:39" (1/1) ... [2024-10-11 17:20:39,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:20:40,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:20:40,325 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:20:40,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:20:40,414 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:20:40,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:40 WrapperNode [2024-10-11 17:20:40,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:20:40,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:20:40,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:20:40,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:20:40,422 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:40" (1/1) ... [2024-10-11 17:20:40,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:40" (1/1) ... [2024-10-11 17:20:40,468 INFO L138 Inliner]: procedures = 263, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 84 [2024-10-11 17:20:40,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:20:40,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:20:40,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:20:40,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:20:40,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:40" (1/1) ... [2024-10-11 17:20:40,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:40" (1/1) ... [2024-10-11 17:20:40,487 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:40" (1/1) ... [2024-10-11 17:20:40,487 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:40" (1/1) ... [2024-10-11 17:20:40,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:40" (1/1) ... [2024-10-11 17:20:40,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:40" (1/1) ... [2024-10-11 17:20:40,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:40" (1/1) ... [2024-10-11 17:20:40,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:40" (1/1) ... [2024-10-11 17:20:40,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:20:40,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:20:40,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:20:40,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:20:40,513 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:40" (1/1) ... [2024-10-11 17:20:40,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:20:40,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:20:40,540 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:20:40,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:20:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-11 17:20:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:20:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:20:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:20:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:20:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-11 17:20:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-11 17:20:40,573 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-11 17:20:40,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:20:40,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:20:40,574 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:20:40,674 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:20:40,676 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:20:40,881 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:20:40,882 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:20:40,892 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:20:40,892 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:20:40,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:20:40 BoogieIcfgContainer [2024-10-11 17:20:40,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:20:40,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:20:40,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:20:40,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:20:40,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:20:39" (1/3) ... [2024-10-11 17:20:40,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b85691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:20:40, skipping insertion in model container [2024-10-11 17:20:40,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:20:40" (2/3) ... [2024-10-11 17:20:40,899 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30b85691 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:20:40, skipping insertion in model container [2024-10-11 17:20:40,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:20:40" (3/3) ... [2024-10-11 17:20:40,900 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-struct-tid.i [2024-10-11 17:20:40,914 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:20:40,914 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2024-10-11 17:20:40,915 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:20:40,962 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-11 17:20:40,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 110 transitions, 227 flow [2024-10-11 17:20:41,043 INFO L124 PetriNetUnfolderBase]: 6/160 cut-off events. [2024-10-11 17:20:41,043 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:20:41,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 160 events. 6/160 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 223 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. [2024-10-11 17:20:41,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 110 transitions, 227 flow [2024-10-11 17:20:41,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 110 transitions, 227 flow [2024-10-11 17:20:41,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:20:41,072 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;@49f71218, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:20:41,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 17:20:41,084 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:20:41,085 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2024-10-11 17:20:41,085 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:20:41,085 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:41,086 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] [2024-10-11 17:20:41,086 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:20:41,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:41,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1099474648, now seen corresponding path program 1 times [2024-10-11 17:20:41,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:41,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340428290] [2024-10-11 17:20:41,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:41,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:41,468 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-11 17:20:41,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:41,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340428290] [2024-10-11 17:20:41,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340428290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:41,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:41,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:41,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736229732] [2024-10-11 17:20:41,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:41,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:20:41,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:41,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:20:41,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:20:41,614 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 110 [2024-10-11 17:20:41,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 110 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 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-11 17:20:41,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:41,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 110 [2024-10-11 17:20:41,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:41,685 INFO L124 PetriNetUnfolderBase]: 1/161 cut-off events. [2024-10-11 17:20:41,685 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:20:41,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 161 events. 1/161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 178 event pairs, 0 based on Foata normal form. 2/152 useless extension candidates. Maximal degree in co-relation 39. Up to 16 conditions per place. [2024-10-11 17:20:41,688 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 11 selfloop transitions, 2 changer transitions 6/112 dead transitions. [2024-10-11 17:20:41,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 112 transitions, 267 flow [2024-10-11 17:20:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 588 transitions. [2024-10-11 17:20:41,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8909090909090909 [2024-10-11 17:20:41,706 INFO L175 Difference]: Start difference. First operand has 109 places, 110 transitions, 227 flow. Second operand 6 states and 588 transitions. [2024-10-11 17:20:41,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 112 transitions, 267 flow [2024-10-11 17:20:41,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 112 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:41,715 INFO L231 Difference]: Finished difference. Result has 118 places, 106 transitions, 237 flow [2024-10-11 17:20:41,718 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=118, PETRI_TRANSITIONS=106} [2024-10-11 17:20:41,721 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 9 predicate places. [2024-10-11 17:20:41,723 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 106 transitions, 237 flow [2024-10-11 17:20:41,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.4) internal successors, (477), 5 states have internal predecessors, (477), 0 states have call successors, (0), 0 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-11 17:20:41,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:41,724 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:41,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:20:41,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:20:41,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:41,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1971613969, now seen corresponding path program 1 times [2024-10-11 17:20:41,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:41,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112334675] [2024-10-11 17:20:41,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:41,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:42,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:42,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112334675] [2024-10-11 17:20:42,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112334675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:42,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:42,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:42,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545751670] [2024-10-11 17:20:42,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:42,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:42,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:42,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:42,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:42,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 110 [2024-10-11 17:20:42,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 106 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 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-11 17:20:42,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:42,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 110 [2024-10-11 17:20:42,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:42,569 INFO L124 PetriNetUnfolderBase]: 106/500 cut-off events. [2024-10-11 17:20:42,569 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-10-11 17:20:42,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 816 conditions, 500 events. 106/500 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2454 event pairs, 68 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 692. Up to 240 conditions per place. [2024-10-11 17:20:42,575 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 35 selfloop transitions, 22 changer transitions 0/127 dead transitions. [2024-10-11 17:20:42,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 127 transitions, 393 flow [2024-10-11 17:20:42,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:42,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 484 transitions. [2024-10-11 17:20:42,580 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2024-10-11 17:20:42,580 INFO L175 Difference]: Start difference. First operand has 118 places, 106 transitions, 237 flow. Second operand 6 states and 484 transitions. [2024-10-11 17:20:42,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 127 transitions, 393 flow [2024-10-11 17:20:42,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 127 transitions, 379 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-11 17:20:42,584 INFO L231 Difference]: Finished difference. Result has 119 places, 127 transitions, 373 flow [2024-10-11 17:20:42,585 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=373, PETRI_PLACES=119, PETRI_TRANSITIONS=127} [2024-10-11 17:20:42,586 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 10 predicate places. [2024-10-11 17:20:42,586 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 127 transitions, 373 flow [2024-10-11 17:20:42,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 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-11 17:20:42,586 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:42,587 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] [2024-10-11 17:20:42,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:20:42,587 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:20:42,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:42,588 INFO L85 PathProgramCache]: Analyzing trace with hash -273716679, now seen corresponding path program 1 times [2024-10-11 17:20:42,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:42,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430137588] [2024-10-11 17:20:42,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:42,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:42,843 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-11 17:20:42,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:42,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430137588] [2024-10-11 17:20:42,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430137588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:42,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:42,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:42,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067258338] [2024-10-11 17:20:42,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:42,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:42,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:42,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:42,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:42,945 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 110 [2024-10-11 17:20:42,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 127 transitions, 373 flow. Second operand has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 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-11 17:20:42,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:42,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 110 [2024-10-11 17:20:42,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:43,028 INFO L124 PetriNetUnfolderBase]: 125/565 cut-off events. [2024-10-11 17:20:43,029 INFO L125 PetriNetUnfolderBase]: For 108/114 co-relation queries the response was YES. [2024-10-11 17:20:43,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 565 events. 125/565 cut-off events. For 108/114 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2794 event pairs, 55 based on Foata normal form. 0/513 useless extension candidates. Maximal degree in co-relation 998. Up to 268 conditions per place. [2024-10-11 17:20:43,033 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 52 selfloop transitions, 22 changer transitions 0/148 dead transitions. [2024-10-11 17:20:43,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 148 transitions, 595 flow [2024-10-11 17:20:43,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:43,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 494 transitions. [2024-10-11 17:20:43,034 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7484848484848485 [2024-10-11 17:20:43,035 INFO L175 Difference]: Start difference. First operand has 119 places, 127 transitions, 373 flow. Second operand 6 states and 494 transitions. [2024-10-11 17:20:43,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 148 transitions, 595 flow [2024-10-11 17:20:43,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 148 transitions, 595 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:43,043 INFO L231 Difference]: Finished difference. Result has 129 places, 148 transitions, 555 flow [2024-10-11 17:20:43,043 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=555, PETRI_PLACES=129, PETRI_TRANSITIONS=148} [2024-10-11 17:20:43,043 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 20 predicate places. [2024-10-11 17:20:43,044 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 148 transitions, 555 flow [2024-10-11 17:20:43,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 0 states have call successors, (0), 0 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-11 17:20:43,044 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:43,044 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] [2024-10-11 17:20:43,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:20:43,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:20:43,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:43,045 INFO L85 PathProgramCache]: Analyzing trace with hash -624886610, now seen corresponding path program 1 times [2024-10-11 17:20:43,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:43,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911584654] [2024-10-11 17:20:43,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:43,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:43,318 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-11 17:20:43,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:43,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911584654] [2024-10-11 17:20:43,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911584654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:43,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:43,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:43,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347986944] [2024-10-11 17:20:43,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:43,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:43,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:43,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:43,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:43,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 110 [2024-10-11 17:20:43,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 148 transitions, 555 flow. Second operand has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 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-11 17:20:43,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:43,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 110 [2024-10-11 17:20:43,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:43,622 INFO L124 PetriNetUnfolderBase]: 283/933 cut-off events. [2024-10-11 17:20:43,623 INFO L125 PetriNetUnfolderBase]: For 443/479 co-relation queries the response was YES. [2024-10-11 17:20:43,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2306 conditions, 933 events. 283/933 cut-off events. For 443/479 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5323 event pairs, 47 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 2159. Up to 489 conditions per place. [2024-10-11 17:20:43,627 INFO L140 encePairwiseOnDemand]: 87/110 looper letters, 60 selfloop transitions, 90 changer transitions 7/229 dead transitions. [2024-10-11 17:20:43,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 229 transitions, 1163 flow [2024-10-11 17:20:43,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:43,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 557 transitions. [2024-10-11 17:20:43,630 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.843939393939394 [2024-10-11 17:20:43,630 INFO L175 Difference]: Start difference. First operand has 129 places, 148 transitions, 555 flow. Second operand 6 states and 557 transitions. [2024-10-11 17:20:43,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 229 transitions, 1163 flow [2024-10-11 17:20:43,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 229 transitions, 1125 flow, removed 19 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:43,639 INFO L231 Difference]: Finished difference. Result has 139 places, 222 transitions, 1239 flow [2024-10-11 17:20:43,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1239, PETRI_PLACES=139, PETRI_TRANSITIONS=222} [2024-10-11 17:20:43,641 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 30 predicate places. [2024-10-11 17:20:43,641 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 222 transitions, 1239 flow [2024-10-11 17:20:43,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.66666666666667) internal successors, (472), 6 states have internal predecessors, (472), 0 states have call successors, (0), 0 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-11 17:20:43,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:43,641 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:43,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:20:43,643 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:20:43,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:43,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1210714979, now seen corresponding path program 1 times [2024-10-11 17:20:43,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:43,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572414779] [2024-10-11 17:20:43,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:43,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:20:43,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:43,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572414779] [2024-10-11 17:20:43,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572414779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:43,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:43,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:43,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757582371] [2024-10-11 17:20:43,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:43,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:43,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:43,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:43,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:44,111 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 110 [2024-10-11 17:20:44,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 222 transitions, 1239 flow. Second operand has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 0 states have call successors, (0), 0 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-11 17:20:44,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:44,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 110 [2024-10-11 17:20:44,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:44,269 INFO L124 PetriNetUnfolderBase]: 282/973 cut-off events. [2024-10-11 17:20:44,269 INFO L125 PetriNetUnfolderBase]: For 1088/1180 co-relation queries the response was YES. [2024-10-11 17:20:44,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3096 conditions, 973 events. 282/973 cut-off events. For 1088/1180 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6038 event pairs, 18 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 2922. Up to 400 conditions per place. [2024-10-11 17:20:44,276 INFO L140 encePairwiseOnDemand]: 94/110 looper letters, 125 selfloop transitions, 36 changer transitions 0/252 dead transitions. [2024-10-11 17:20:44,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 252 transitions, 1770 flow [2024-10-11 17:20:44,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:44,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 506 transitions. [2024-10-11 17:20:44,277 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7666666666666667 [2024-10-11 17:20:44,277 INFO L175 Difference]: Start difference. First operand has 139 places, 222 transitions, 1239 flow. Second operand 6 states and 506 transitions. [2024-10-11 17:20:44,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 252 transitions, 1770 flow [2024-10-11 17:20:44,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 252 transitions, 1734 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:44,291 INFO L231 Difference]: Finished difference. Result has 141 places, 251 transitions, 1589 flow [2024-10-11 17:20:44,294 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1589, PETRI_PLACES=141, PETRI_TRANSITIONS=251} [2024-10-11 17:20:44,294 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 32 predicate places. [2024-10-11 17:20:44,295 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 251 transitions, 1589 flow [2024-10-11 17:20:44,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.83333333333333) internal successors, (467), 6 states have internal predecessors, (467), 0 states have call successors, (0), 0 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-11 17:20:44,296 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:44,296 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] [2024-10-11 17:20:44,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:20:44,296 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:20:44,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash 366262447, now seen corresponding path program 1 times [2024-10-11 17:20:44,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:44,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048414676] [2024-10-11 17:20:44,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:44,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:44,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:20:44,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:44,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048414676] [2024-10-11 17:20:44,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048414676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:44,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:20:44,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:20:44,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642749577] [2024-10-11 17:20:44,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:44,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:20:44,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:44,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:20:44,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:20:44,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 110 [2024-10-11 17:20:44,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 251 transitions, 1589 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 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-11 17:20:44,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:44,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 110 [2024-10-11 17:20:44,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:44,880 INFO L124 PetriNetUnfolderBase]: 324/1067 cut-off events. [2024-10-11 17:20:44,880 INFO L125 PetriNetUnfolderBase]: For 1949/2043 co-relation queries the response was YES. [2024-10-11 17:20:44,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3802 conditions, 1067 events. 324/1067 cut-off events. For 1949/2043 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6703 event pairs, 21 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 3604. Up to 441 conditions per place. [2024-10-11 17:20:44,889 INFO L140 encePairwiseOnDemand]: 99/110 looper letters, 136 selfloop transitions, 37 changer transitions 29/291 dead transitions. [2024-10-11 17:20:44,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 291 transitions, 2350 flow [2024-10-11 17:20:44,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:20:44,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:20:44,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 544 transitions. [2024-10-11 17:20:44,891 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8242424242424242 [2024-10-11 17:20:44,892 INFO L175 Difference]: Start difference. First operand has 141 places, 251 transitions, 1589 flow. Second operand 6 states and 544 transitions. [2024-10-11 17:20:44,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 291 transitions, 2350 flow [2024-10-11 17:20:44,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 291 transitions, 2192 flow, removed 79 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:44,908 INFO L231 Difference]: Finished difference. Result has 151 places, 262 transitions, 1852 flow [2024-10-11 17:20:44,908 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1495, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1852, PETRI_PLACES=151, PETRI_TRANSITIONS=262} [2024-10-11 17:20:44,909 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 42 predicate places. [2024-10-11 17:20:44,910 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 262 transitions, 1852 flow [2024-10-11 17:20:44,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 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-11 17:20:44,911 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:44,911 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] [2024-10-11 17:20:44,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:20:44,911 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:20:44,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:44,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1030629718, now seen corresponding path program 1 times [2024-10-11 17:20:44,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:44,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238442561] [2024-10-11 17:20:44,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:44,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:45,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:45,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:45,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238442561] [2024-10-11 17:20:45,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238442561] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:20:45,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865420250] [2024-10-11 17:20:45,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:45,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:20:45,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:20:45,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:20:45,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:20:45,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:45,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 17:20:45,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:20:45,478 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-11 17:20:45,505 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:20:45,506 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-11 17:20:45,587 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 13 treesize of output 9 [2024-10-11 17:20:45,597 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 23 treesize of output 22 [2024-10-11 17:20:45,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:45,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2024-10-11 17:20:45,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:45,637 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2024-10-11 17:20:45,663 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 45 treesize of output 34 [2024-10-11 17:20:45,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:45,675 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:20:45,714 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 7 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false [2024-10-11 17:20:45,739 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4))))))) is different from false [2024-10-11 17:20:45,767 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ 5 c_threadThread1of1ForFork0_~t~0.offset)))) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-10-11 17:20:45,788 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 5 c_threadThread1of1ForFork0_~t~0.offset)) (.cse2 (+ 6 c_threadThread1of1ForFork0_~t~0.offset)) (.cse1 (+ 7 c_threadThread1of1ForFork0_~t~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of1ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of1ForFork0_~t~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) (+ c_threadThread1of1ForFork0_~t~0.offset 4)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~ts~0#1.base| v_ArrVal_298) c_threadThread1of1ForFork0_~t~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false [2024-10-11 17:20:45,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:45,808 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 4 case distinctions, treesize of input 37 treesize of output 53 [2024-10-11 17:20:45,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:45,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 32 [2024-10-11 17:20:45,844 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-11 17:20:45,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-11 17:20:45,856 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-11 17:20:45,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-11 17:20:45,862 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-10-11 17:20:45,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2024-10-11 17:20:45,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:45,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865420250] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:20:45,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:20:45,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2024-10-11 17:20:45,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773770685] [2024-10-11 17:20:45,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:20:45,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 17:20:45,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:45,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 17:20:45,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=202, Unknown=4, NotChecked=124, Total=380 [2024-10-11 17:20:45,941 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 110 [2024-10-11 17:20:45,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 262 transitions, 1852 flow. Second operand has 20 states, 20 states have (on average 50.1) internal successors, (1002), 20 states have internal predecessors, (1002), 0 states have call successors, (0), 0 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-11 17:20:45,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:45,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 110 [2024-10-11 17:20:45,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:47,754 INFO L124 PetriNetUnfolderBase]: 543/1476 cut-off events. [2024-10-11 17:20:47,755 INFO L125 PetriNetUnfolderBase]: For 2830/2830 co-relation queries the response was YES. [2024-10-11 17:20:47,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5714 conditions, 1476 events. 543/1476 cut-off events. For 2830/2830 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 9296 event pairs, 41 based on Foata normal form. 23/1494 useless extension candidates. Maximal degree in co-relation 5582. Up to 350 conditions per place. [2024-10-11 17:20:47,764 INFO L140 encePairwiseOnDemand]: 85/110 looper letters, 290 selfloop transitions, 166 changer transitions 8/501 dead transitions. [2024-10-11 17:20:47,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 501 transitions, 4196 flow [2024-10-11 17:20:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-11 17:20:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-10-11 17:20:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2012 transitions. [2024-10-11 17:20:47,770 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5080808080808081 [2024-10-11 17:20:47,770 INFO L175 Difference]: Start difference. First operand has 151 places, 262 transitions, 1852 flow. Second operand 36 states and 2012 transitions. [2024-10-11 17:20:47,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 501 transitions, 4196 flow [2024-10-11 17:20:47,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 501 transitions, 4112 flow, removed 42 selfloop flow, removed 0 redundant places. [2024-10-11 17:20:47,797 INFO L231 Difference]: Finished difference. Result has 183 places, 330 transitions, 2820 flow [2024-10-11 17:20:47,797 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=1768, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2820, PETRI_PLACES=183, PETRI_TRANSITIONS=330} [2024-10-11 17:20:47,798 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 74 predicate places. [2024-10-11 17:20:47,799 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 330 transitions, 2820 flow [2024-10-11 17:20:47,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 50.1) internal successors, (1002), 20 states have internal predecessors, (1002), 0 states have call successors, (0), 0 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-11 17:20:47,800 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:47,801 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] [2024-10-11 17:20:47,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 17:20:48,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:20:48,002 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:20:48,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:48,002 INFO L85 PathProgramCache]: Analyzing trace with hash 727956110, now seen corresponding path program 1 times [2024-10-11 17:20:48,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:48,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902364667] [2024-10-11 17:20:48,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:48,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:48,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:48,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902364667] [2024-10-11 17:20:48,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902364667] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:20:48,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948154911] [2024-10-11 17:20:48,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:48,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:20:48,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:20:48,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:20:48,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:20:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:48,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 17:20:48,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:20:48,477 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-11 17:20:48,508 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:20:48,509 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-11 17:20:48,575 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-11 17:20:48,598 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 21 treesize of output 20 [2024-10-11 17:20:48,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:48,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-11 17:20:48,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:48,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-11 17:20:48,707 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 43 treesize of output 32 [2024-10-11 17:20:48,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:48,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:20:50,651 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false [2024-10-11 17:20:50,670 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_403) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-10-11 17:20:52,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:52,595 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 4 case distinctions, treesize of input 51 treesize of output 67 [2024-10-11 17:20:52,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:52,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2024-10-11 17:20:52,602 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-11 17:20:52,613 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:20:52,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:20:52,618 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:20:52,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:20:52,623 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:20:52,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-10-11 17:20:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:52,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948154911] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:20:52,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:20:52,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 25 [2024-10-11 17:20:52,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860450039] [2024-10-11 17:20:52,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:20:52,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 17:20:52,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:52,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 17:20:52,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=428, Unknown=32, NotChecked=90, Total=650 [2024-10-11 17:20:52,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-10-11 17:20:52,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 330 transitions, 2820 flow. Second operand has 26 states, 26 states have (on average 46.03846153846154) internal successors, (1197), 26 states have internal predecessors, (1197), 0 states have call successors, (0), 0 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-11 17:20:52,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:52,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-10-11 17:20:52,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:54,630 INFO L124 PetriNetUnfolderBase]: 738/2074 cut-off events. [2024-10-11 17:20:54,631 INFO L125 PetriNetUnfolderBase]: For 8047/8055 co-relation queries the response was YES. [2024-10-11 17:20:54,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9760 conditions, 2074 events. 738/2074 cut-off events. For 8047/8055 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 14929 event pairs, 51 based on Foata normal form. 23/2093 useless extension candidates. Maximal degree in co-relation 9606. Up to 566 conditions per place. [2024-10-11 17:20:54,645 INFO L140 encePairwiseOnDemand]: 93/110 looper letters, 455 selfloop transitions, 97 changer transitions 17/612 dead transitions. [2024-10-11 17:20:54,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 612 transitions, 6695 flow [2024-10-11 17:20:54,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-11 17:20:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2024-10-11 17:20:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1586 transitions. [2024-10-11 17:20:54,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46510263929618767 [2024-10-11 17:20:54,649 INFO L175 Difference]: Start difference. First operand has 183 places, 330 transitions, 2820 flow. Second operand 31 states and 1586 transitions. [2024-10-11 17:20:54,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 612 transitions, 6695 flow [2024-10-11 17:20:54,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 612 transitions, 6337 flow, removed 152 selfloop flow, removed 8 redundant places. [2024-10-11 17:20:54,703 INFO L231 Difference]: Finished difference. Result has 215 places, 380 transitions, 3350 flow [2024-10-11 17:20:54,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=2661, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=3350, PETRI_PLACES=215, PETRI_TRANSITIONS=380} [2024-10-11 17:20:54,704 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 106 predicate places. [2024-10-11 17:20:54,704 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 380 transitions, 3350 flow [2024-10-11 17:20:54,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 46.03846153846154) internal successors, (1197), 26 states have internal predecessors, (1197), 0 states have call successors, (0), 0 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-11 17:20:54,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:54,709 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] [2024-10-11 17:20:54,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 17:20:54,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:20:54,911 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:20:54,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:54,912 INFO L85 PathProgramCache]: Analyzing trace with hash 550388250, now seen corresponding path program 2 times [2024-10-11 17:20:54,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:54,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13927909] [2024-10-11 17:20:54,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:54,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:55,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:55,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13927909] [2024-10-11 17:20:55,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13927909] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:20:55,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541083829] [2024-10-11 17:20:55,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:20:55,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:20:55,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:20:55,287 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:20:55,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:20:55,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:20:55,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:20:55,390 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 17:20:55,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:20:55,590 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:20:55,621 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 19 treesize of output 18 [2024-10-11 17:20:55,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:55,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-11 17:20:55,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:55,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-10-11 17:20:55,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:20:55,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:20:55,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:20:55,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:20:55,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:55,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 41 [2024-10-11 17:20:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:55,870 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:20:55,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541083829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:20:55,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:20:55,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 26 [2024-10-11 17:20:55,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45385763] [2024-10-11 17:20:55,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:20:55,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:20:55,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:55,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:20:55,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2024-10-11 17:20:56,550 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 110 [2024-10-11 17:20:56,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 380 transitions, 3350 flow. Second operand has 15 states, 15 states have (on average 68.73333333333333) internal successors, (1031), 15 states have internal predecessors, (1031), 0 states have call successors, (0), 0 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-11 17:20:56,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:56,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 110 [2024-10-11 17:20:56,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:20:57,329 INFO L124 PetriNetUnfolderBase]: 824/2582 cut-off events. [2024-10-11 17:20:57,330 INFO L125 PetriNetUnfolderBase]: For 10369/10508 co-relation queries the response was YES. [2024-10-11 17:20:57,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12131 conditions, 2582 events. 824/2582 cut-off events. For 10369/10508 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 21484 event pairs, 30 based on Foata normal form. 19/2588 useless extension candidates. Maximal degree in co-relation 11970. Up to 832 conditions per place. [2024-10-11 17:20:57,349 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 361 selfloop transitions, 102 changer transitions 0/555 dead transitions. [2024-10-11 17:20:57,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 555 transitions, 6182 flow [2024-10-11 17:20:57,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 17:20:57,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-10-11 17:20:57,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1592 transitions. [2024-10-11 17:20:57,352 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6578512396694215 [2024-10-11 17:20:57,353 INFO L175 Difference]: Start difference. First operand has 215 places, 380 transitions, 3350 flow. Second operand 22 states and 1592 transitions. [2024-10-11 17:20:57,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 555 transitions, 6182 flow [2024-10-11 17:20:57,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 555 transitions, 6113 flow, removed 0 selfloop flow, removed 16 redundant places. [2024-10-11 17:20:57,436 INFO L231 Difference]: Finished difference. Result has 227 places, 432 transitions, 4346 flow [2024-10-11 17:20:57,437 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=3281, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4346, PETRI_PLACES=227, PETRI_TRANSITIONS=432} [2024-10-11 17:20:57,437 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 118 predicate places. [2024-10-11 17:20:57,437 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 432 transitions, 4346 flow [2024-10-11 17:20:57,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 68.73333333333333) internal successors, (1031), 15 states have internal predecessors, (1031), 0 states have call successors, (0), 0 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-11 17:20:57,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:20:57,438 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:20:57,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 17:20:57,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:20:57,645 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:20:57,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:20:57,646 INFO L85 PathProgramCache]: Analyzing trace with hash -211730128, now seen corresponding path program 3 times [2024-10-11 17:20:57,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:20:57,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763506784] [2024-10-11 17:20:57,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:20:57,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:20:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:20:58,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:58,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:20:58,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763506784] [2024-10-11 17:20:58,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763506784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:20:58,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1383085481] [2024-10-11 17:20:58,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:20:58,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:20:58,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:20:58,010 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:20:58,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:20:58,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 17:20:58,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:20:58,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-11 17:20:58,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:20:58,114 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-11 17:20:58,161 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:20:58,162 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-11 17:20:58,313 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-11 17:20:58,367 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-11 17:20:58,408 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-11 17:20:58,447 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-11 17:20:58,529 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 37 treesize of output 26 [2024-10-11 17:20:58,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:58,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:20:58,691 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false [2024-10-11 17:20:58,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-10-11 17:20:58,720 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse4 0) .cse2 0)))) (and (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2024-10-11 17:20:58,737 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_613 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_613) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false [2024-10-11 17:20:58,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:58,749 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 4 case distinctions, treesize of input 50 treesize of output 66 [2024-10-11 17:20:58,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:20:58,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38 [2024-10-11 17:20:58,759 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 9 treesize of output 3 [2024-10-11 17:20:58,765 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:20:58,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:20:58,771 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:20:58,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:20:58,780 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:20:58,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:20:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:20:58,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1383085481] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:20:58,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:20:58,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 33 [2024-10-11 17:20:58,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342104122] [2024-10-11 17:20:58,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:20:58,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-11 17:20:58,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:20:58,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-11 17:20:58,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=759, Unknown=17, NotChecked=236, Total=1122 [2024-10-11 17:20:58,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-10-11 17:20:58,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 432 transitions, 4346 flow. Second operand has 34 states, 34 states have (on average 46.26470588235294) internal successors, (1573), 34 states have internal predecessors, (1573), 0 states have call successors, (0), 0 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-11 17:20:58,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:20:58,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-10-11 17:20:58,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:00,908 INFO L124 PetriNetUnfolderBase]: 1439/4061 cut-off events. [2024-10-11 17:21:00,908 INFO L125 PetriNetUnfolderBase]: For 18775/18797 co-relation queries the response was YES. [2024-10-11 17:21:00,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20566 conditions, 4061 events. 1439/4061 cut-off events. For 18775/18797 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 35711 event pairs, 149 based on Foata normal form. 30/4082 useless extension candidates. Maximal degree in co-relation 20391. Up to 1243 conditions per place. [2024-10-11 17:21:00,993 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 677 selfloop transitions, 193 changer transitions 13/926 dead transitions. [2024-10-11 17:21:00,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 926 transitions, 11449 flow [2024-10-11 17:21:00,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-11 17:21:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-10-11 17:21:00,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1587 transitions. [2024-10-11 17:21:00,996 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4809090909090909 [2024-10-11 17:21:00,996 INFO L175 Difference]: Start difference. First operand has 227 places, 432 transitions, 4346 flow. Second operand 30 states and 1587 transitions. [2024-10-11 17:21:00,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 926 transitions, 11449 flow [2024-10-11 17:21:01,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 926 transitions, 11378 flow, removed 2 selfloop flow, removed 14 redundant places. [2024-10-11 17:21:01,107 INFO L231 Difference]: Finished difference. Result has 255 places, 540 transitions, 6549 flow [2024-10-11 17:21:01,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=4277, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=6549, PETRI_PLACES=255, PETRI_TRANSITIONS=540} [2024-10-11 17:21:01,108 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 146 predicate places. [2024-10-11 17:21:01,108 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 540 transitions, 6549 flow [2024-10-11 17:21:01,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 46.26470588235294) internal successors, (1573), 34 states have internal predecessors, (1573), 0 states have call successors, (0), 0 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-11 17:21:01,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:01,108 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] [2024-10-11 17:21:01,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 17:21:01,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 17:21:01,309 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:01,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:01,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1029781006, now seen corresponding path program 4 times [2024-10-11 17:21:01,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:01,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118501320] [2024-10-11 17:21:01,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:01,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:01,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:01,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118501320] [2024-10-11 17:21:01,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118501320] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:21:01,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401520419] [2024-10-11 17:21:01,691 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:21:01,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:01,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:01,693 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:21:01,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:21:01,847 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:21:01,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:21:01,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 17:21:01,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:21:02,008 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:21:02,034 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 19 treesize of output 18 [2024-10-11 17:21:02,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:02,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2024-10-11 17:21:02,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:02,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2024-10-11 17:21:02,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:21:02,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:21:02,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:21:02,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:21:02,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:02,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 41 [2024-10-11 17:21:02,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:02,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:21:02,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401520419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:21:02,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:21:02,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 26 [2024-10-11 17:21:02,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031468069] [2024-10-11 17:21:02,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:21:02,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:21:02,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:02,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:21:02,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2024-10-11 17:21:02,921 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 110 [2024-10-11 17:21:02,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 540 transitions, 6549 flow. Second operand has 15 states, 15 states have (on average 68.73333333333333) internal successors, (1031), 15 states have internal predecessors, (1031), 0 states have call successors, (0), 0 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-11 17:21:02,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:02,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 110 [2024-10-11 17:21:02,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:03,833 INFO L124 PetriNetUnfolderBase]: 1227/3863 cut-off events. [2024-10-11 17:21:03,834 INFO L125 PetriNetUnfolderBase]: For 24570/24962 co-relation queries the response was YES. [2024-10-11 17:21:03,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20046 conditions, 3863 events. 1227/3863 cut-off events. For 24570/24962 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 36348 event pairs, 53 based on Foata normal form. 88/3936 useless extension candidates. Maximal degree in co-relation 19865. Up to 1286 conditions per place. [2024-10-11 17:21:03,866 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 306 selfloop transitions, 220 changer transitions 0/618 dead transitions. [2024-10-11 17:21:03,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 618 transitions, 8696 flow [2024-10-11 17:21:03,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 17:21:03,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-10-11 17:21:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1374 transitions. [2024-10-11 17:21:03,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6574162679425838 [2024-10-11 17:21:03,869 INFO L175 Difference]: Start difference. First operand has 255 places, 540 transitions, 6549 flow. Second operand 19 states and 1374 transitions. [2024-10-11 17:21:03,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 618 transitions, 8696 flow [2024-10-11 17:21:04,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 618 transitions, 8370 flow, removed 115 selfloop flow, removed 16 redundant places. [2024-10-11 17:21:04,054 INFO L231 Difference]: Finished difference. Result has 261 places, 569 transitions, 7556 flow [2024-10-11 17:21:04,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=6283, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7556, PETRI_PLACES=261, PETRI_TRANSITIONS=569} [2024-10-11 17:21:04,055 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 152 predicate places. [2024-10-11 17:21:04,055 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 569 transitions, 7556 flow [2024-10-11 17:21:04,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 68.73333333333333) internal successors, (1031), 15 states have internal predecessors, (1031), 0 states have call successors, (0), 0 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-11 17:21:04,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:04,057 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] [2024-10-11 17:21:04,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 17:21:04,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 17:21:04,258 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:04,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:04,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1481670000, now seen corresponding path program 5 times [2024-10-11 17:21:04,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:04,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386173850] [2024-10-11 17:21:04,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:04,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:04,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:04,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386173850] [2024-10-11 17:21:04,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386173850] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:21:04,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927788138] [2024-10-11 17:21:04,662 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 17:21:04,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:04,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:04,663 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:21:04,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 17:21:04,764 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:21:04,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:21:04,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-11 17:21:04,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:21:04,771 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-11 17:21:04,826 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:21:04,827 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-11 17:21:04,955 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-11 17:21:04,983 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-11 17:21:05,039 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-11 17:21:05,071 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-11 17:21:05,138 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 37 treesize of output 26 [2024-10-11 17:21:05,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:05,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:21:05,181 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)))) is different from false [2024-10-11 17:21:05,217 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false [2024-10-11 17:21:05,228 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)))))) is different from false [2024-10-11 17:21:05,238 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-10-11 17:21:05,248 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_823 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_823) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2024-10-11 17:21:05,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:05,258 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 4 case distinctions, treesize of input 50 treesize of output 66 [2024-10-11 17:21:05,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:05,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38 [2024-10-11 17:21:05,267 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 9 treesize of output 3 [2024-10-11 17:21:05,272 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:05,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:21:05,276 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:05,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:21:05,280 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:05,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:21:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:05,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927788138] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:21:05,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:21:05,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 32 [2024-10-11 17:21:05,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996766759] [2024-10-11 17:21:05,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:21:05,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 17:21:05,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:05,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 17:21:05,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=669, Unknown=5, NotChecked=280, Total=1056 [2024-10-11 17:21:05,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 110 [2024-10-11 17:21:05,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 569 transitions, 7556 flow. Second operand has 33 states, 33 states have (on average 40.57575757575758) internal successors, (1339), 33 states have internal predecessors, (1339), 0 states have call successors, (0), 0 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-11 17:21:05,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:05,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 110 [2024-10-11 17:21:05,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:07,790 INFO L124 PetriNetUnfolderBase]: 1937/5508 cut-off events. [2024-10-11 17:21:07,790 INFO L125 PetriNetUnfolderBase]: For 36192/36199 co-relation queries the response was YES. [2024-10-11 17:21:07,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29868 conditions, 5508 events. 1937/5508 cut-off events. For 36192/36199 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 52043 event pairs, 194 based on Foata normal form. 27/5530 useless extension candidates. Maximal degree in co-relation 29675. Up to 1696 conditions per place. [2024-10-11 17:21:07,836 INFO L140 encePairwiseOnDemand]: 87/110 looper letters, 704 selfloop transitions, 274 changer transitions 15/1030 dead transitions. [2024-10-11 17:21:07,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 1030 transitions, 15155 flow [2024-10-11 17:21:07,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 17:21:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-10-11 17:21:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 1623 transitions. [2024-10-11 17:21:07,840 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4215584415584416 [2024-10-11 17:21:07,840 INFO L175 Difference]: Start difference. First operand has 261 places, 569 transitions, 7556 flow. Second operand 35 states and 1623 transitions. [2024-10-11 17:21:07,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 1030 transitions, 15155 flow [2024-10-11 17:21:08,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 1030 transitions, 14982 flow, removed 3 selfloop flow, removed 13 redundant places. [2024-10-11 17:21:08,096 INFO L231 Difference]: Finished difference. Result has 293 places, 654 transitions, 9960 flow [2024-10-11 17:21:08,097 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=7410, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=193, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=9960, PETRI_PLACES=293, PETRI_TRANSITIONS=654} [2024-10-11 17:21:08,099 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 184 predicate places. [2024-10-11 17:21:08,099 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 654 transitions, 9960 flow [2024-10-11 17:21:08,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 40.57575757575758) internal successors, (1339), 33 states have internal predecessors, (1339), 0 states have call successors, (0), 0 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-11 17:21:08,100 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:08,100 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] [2024-10-11 17:21:08,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 17:21:08,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 17:21:08,301 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:08,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:08,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1145105868, now seen corresponding path program 6 times [2024-10-11 17:21:08,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:08,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129862052] [2024-10-11 17:21:08,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:08,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:08,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:08,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129862052] [2024-10-11 17:21:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129862052] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:21:08,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295695246] [2024-10-11 17:21:08,696 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 17:21:08,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:08,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:08,700 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:21:08,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 17:21:08,807 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-10-11 17:21:08,808 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:21:08,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 17:21:08,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:21:08,814 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-11 17:21:08,858 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:21:08,859 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-11 17:21:08,994 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-11 17:21:09,018 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-11 17:21:09,044 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-11 17:21:09,126 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-11 17:21:09,159 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 37 treesize of output 26 [2024-10-11 17:21:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:09,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:21:09,250 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)))))) is different from false [2024-10-11 17:21:09,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false [2024-10-11 17:21:09,295 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false [2024-10-11 17:21:09,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_928 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_928) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false [2024-10-11 17:21:09,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:09,316 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 4 case distinctions, treesize of input 51 treesize of output 67 [2024-10-11 17:21:09,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:09,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2024-10-11 17:21:09,321 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-11 17:21:09,327 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:09,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:21:09,330 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:09,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-10-11 17:21:09,333 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:09,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:21:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:09,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295695246] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:21:09,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:21:09,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 31 [2024-10-11 17:21:09,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41715237] [2024-10-11 17:21:09,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:21:09,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 17:21:09,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:09,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 17:21:09,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=654, Unknown=14, NotChecked=220, Total=992 [2024-10-11 17:21:09,459 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-10-11 17:21:09,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 654 transitions, 9960 flow. Second operand has 32 states, 32 states have (on average 46.28125) internal successors, (1481), 32 states have internal predecessors, (1481), 0 states have call successors, (0), 0 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-11 17:21:09,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:09,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-10-11 17:21:09,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:12,005 INFO L124 PetriNetUnfolderBase]: 2104/6036 cut-off events. [2024-10-11 17:21:12,005 INFO L125 PetriNetUnfolderBase]: For 45502/45522 co-relation queries the response was YES. [2024-10-11 17:21:12,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33851 conditions, 6036 events. 2104/6036 cut-off events. For 45502/45522 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 59291 event pairs, 263 based on Foata normal form. 26/6052 useless extension candidates. Maximal degree in co-relation 33647. Up to 1932 conditions per place. [2024-10-11 17:21:12,060 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 650 selfloop transitions, 318 changer transitions 19/1031 dead transitions. [2024-10-11 17:21:12,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 1031 transitions, 16650 flow [2024-10-11 17:21:12,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-11 17:21:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-10-11 17:21:12,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1579 transitions. [2024-10-11 17:21:12,067 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47848484848484846 [2024-10-11 17:21:12,067 INFO L175 Difference]: Start difference. First operand has 293 places, 654 transitions, 9960 flow. Second operand 30 states and 1579 transitions. [2024-10-11 17:21:12,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 1031 transitions, 16650 flow [2024-10-11 17:21:12,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 1031 transitions, 16361 flow, removed 100 selfloop flow, removed 17 redundant places. [2024-10-11 17:21:12,425 INFO L231 Difference]: Finished difference. Result has 314 places, 718 transitions, 12133 flow [2024-10-11 17:21:12,425 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=9671, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=259, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=12133, PETRI_PLACES=314, PETRI_TRANSITIONS=718} [2024-10-11 17:21:12,425 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 205 predicate places. [2024-10-11 17:21:12,426 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 718 transitions, 12133 flow [2024-10-11 17:21:12,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 46.28125) internal successors, (1481), 32 states have internal predecessors, (1481), 0 states have call successors, (0), 0 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-11 17:21:12,426 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:12,426 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] [2024-10-11 17:21:12,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 17:21:12,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:12,627 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:12,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:12,627 INFO L85 PathProgramCache]: Analyzing trace with hash -820413334, now seen corresponding path program 7 times [2024-10-11 17:21:12,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:12,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456852729] [2024-10-11 17:21:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:13,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:13,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:13,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456852729] [2024-10-11 17:21:13,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456852729] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:21:13,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612054107] [2024-10-11 17:21:13,025 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-11 17:21:13,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:13,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:13,026 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:21:13,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 17:21:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:13,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 17:21:13,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:21:13,126 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-11 17:21:13,153 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:21:13,153 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-11 17:21:13,199 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-11 17:21:13,222 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 21 treesize of output 20 [2024-10-11 17:21:13,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:13,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-10-11 17:21:13,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:13,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-10-11 17:21:13,399 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 43 treesize of output 32 [2024-10-11 17:21:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:13,426 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:21:13,518 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)))) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)))))) is different from false [2024-10-11 17:21:13,556 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)))))) is different from false [2024-10-11 17:21:13,567 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)))))) is different from false [2024-10-11 17:21:13,585 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-10-11 17:21:13,598 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1033) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2024-10-11 17:21:13,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:13,611 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 4 case distinctions, treesize of input 51 treesize of output 67 [2024-10-11 17:21:13,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:13,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2024-10-11 17:21:13,618 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-11 17:21:13,621 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:13,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:21:13,625 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:13,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:21:13,631 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:13,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-10-11 17:21:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:13,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612054107] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:21:13,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:21:13,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 29 [2024-10-11 17:21:13,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366525881] [2024-10-11 17:21:13,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:21:13,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-10-11 17:21:13,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:13,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-10-11 17:21:13,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=511, Unknown=16, NotChecked=250, Total=870 [2024-10-11 17:21:13,719 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-10-11 17:21:13,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 718 transitions, 12133 flow. Second operand has 30 states, 30 states have (on average 45.93333333333333) internal successors, (1378), 30 states have internal predecessors, (1378), 0 states have call successors, (0), 0 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-11 17:21:13,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:13,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-10-11 17:21:13,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:16,114 INFO L124 PetriNetUnfolderBase]: 2319/6651 cut-off events. [2024-10-11 17:21:16,114 INFO L125 PetriNetUnfolderBase]: For 55101/55126 co-relation queries the response was YES. [2024-10-11 17:21:16,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38285 conditions, 6651 events. 2319/6651 cut-off events. For 55101/55126 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 66961 event pairs, 300 based on Foata normal form. 21/6661 useless extension candidates. Maximal degree in co-relation 38074. Up to 2722 conditions per place. [2024-10-11 17:21:16,168 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 490 selfloop transitions, 343 changer transitions 10/887 dead transitions. [2024-10-11 17:21:16,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 887 transitions, 16065 flow [2024-10-11 17:21:16,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 17:21:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-10-11 17:21:16,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1093 transitions. [2024-10-11 17:21:16,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47316017316017317 [2024-10-11 17:21:16,175 INFO L175 Difference]: Start difference. First operand has 314 places, 718 transitions, 12133 flow. Second operand 21 states and 1093 transitions. [2024-10-11 17:21:16,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 887 transitions, 16065 flow [2024-10-11 17:21:16,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 887 transitions, 15565 flow, removed 186 selfloop flow, removed 19 redundant places. [2024-10-11 17:21:16,542 INFO L231 Difference]: Finished difference. Result has 322 places, 758 transitions, 13950 flow [2024-10-11 17:21:16,543 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=11647, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=303, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=13950, PETRI_PLACES=322, PETRI_TRANSITIONS=758} [2024-10-11 17:21:16,543 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 213 predicate places. [2024-10-11 17:21:16,543 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 758 transitions, 13950 flow [2024-10-11 17:21:16,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 45.93333333333333) internal successors, (1378), 30 states have internal predecessors, (1378), 0 states have call successors, (0), 0 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-11 17:21:16,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:16,544 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:21:16,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-11 17:21:16,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 17:21:16,744 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:16,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:16,745 INFO L85 PathProgramCache]: Analyzing trace with hash -768552536, now seen corresponding path program 8 times [2024-10-11 17:21:16,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:16,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275560572] [2024-10-11 17:21:16,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:16,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:17,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:17,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275560572] [2024-10-11 17:21:17,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275560572] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:21:17,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679737126] [2024-10-11 17:21:17,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:21:17,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:17,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:17,145 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:21:17,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 17:21:17,259 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:21:17,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:21:17,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-11 17:21:17,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:21:17,316 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-11 17:21:17,360 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:21:17,360 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-11 17:21:17,546 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-11 17:21:17,639 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-11 17:21:17,672 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-11 17:21:17,705 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-11 17:21:17,745 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 37 treesize of output 26 [2024-10-11 17:21:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:17,773 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:21:17,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)))) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)))) is different from false [2024-10-11 17:21:17,799 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)))))) is different from false [2024-10-11 17:21:17,812 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-10-11 17:21:17,825 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) (.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~t~0.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2024-10-11 17:21:17,866 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse4)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse4)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2))) (forall ((v_ArrVal_1138 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3))) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse4)) 0)))))) is different from false [2024-10-11 17:21:17,878 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse3)) (.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse3)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse4 0) .cse1 0)))) (and (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse3)) 0)) (forall ((v_ArrVal_1138 (Array Int Int))) (= 0 (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1138) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4))))))) is different from false [2024-10-11 17:21:17,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:17,889 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 4 case distinctions, treesize of input 50 treesize of output 66 [2024-10-11 17:21:17,892 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:17,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 38 [2024-10-11 17:21:17,895 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 9 treesize of output 3 [2024-10-11 17:21:17,898 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:17,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:21:17,901 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:17,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:21:17,905 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:17,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:21:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:18,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679737126] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:21:18,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:21:18,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 15] total 42 [2024-10-11 17:21:18,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371061262] [2024-10-11 17:21:18,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:21:18,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-11 17:21:18,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:18,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-11 17:21:18,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1201, Unknown=6, NotChecked=450, Total=1806 [2024-10-11 17:21:18,194 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 110 [2024-10-11 17:21:18,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 758 transitions, 13950 flow. Second operand has 43 states, 43 states have (on average 36.674418604651166) internal successors, (1577), 43 states have internal predecessors, (1577), 0 states have call successors, (0), 0 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-11 17:21:18,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:18,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 110 [2024-10-11 17:21:18,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:21,520 INFO L124 PetriNetUnfolderBase]: 2560/7381 cut-off events. [2024-10-11 17:21:21,521 INFO L125 PetriNetUnfolderBase]: For 70002/70015 co-relation queries the response was YES. [2024-10-11 17:21:21,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43257 conditions, 7381 events. 2560/7381 cut-off events. For 70002/70015 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 75859 event pairs, 337 based on Foata normal form. 22/7390 useless extension candidates. Maximal degree in co-relation 43032. Up to 2644 conditions per place. [2024-10-11 17:21:21,573 INFO L140 encePairwiseOnDemand]: 84/110 looper letters, 566 selfloop transitions, 350 changer transitions 7/958 dead transitions. [2024-10-11 17:21:21,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 958 transitions, 18775 flow [2024-10-11 17:21:21,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 17:21:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-10-11 17:21:21,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1066 transitions. [2024-10-11 17:21:21,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37272727272727274 [2024-10-11 17:21:21,575 INFO L175 Difference]: Start difference. First operand has 322 places, 758 transitions, 13950 flow. Second operand 26 states and 1066 transitions. [2024-10-11 17:21:21,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 958 transitions, 18775 flow [2024-10-11 17:21:22,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 958 transitions, 18514 flow, removed 54 selfloop flow, removed 14 redundant places. [2024-10-11 17:21:22,055 INFO L231 Difference]: Finished difference. Result has 341 places, 808 transitions, 16223 flow [2024-10-11 17:21:22,056 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=13697, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=16223, PETRI_PLACES=341, PETRI_TRANSITIONS=808} [2024-10-11 17:21:22,056 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 232 predicate places. [2024-10-11 17:21:22,057 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 808 transitions, 16223 flow [2024-10-11 17:21:22,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 36.674418604651166) internal successors, (1577), 43 states have internal predecessors, (1577), 0 states have call successors, (0), 0 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-11 17:21:22,057 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:22,057 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] [2024-10-11 17:21:22,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-11 17:21:22,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:22,258 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:22,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:22,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1948267056, now seen corresponding path program 9 times [2024-10-11 17:21:22,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:22,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179365923] [2024-10-11 17:21:22,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:22,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:22,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:22,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:22,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179365923] [2024-10-11 17:21:22,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179365923] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:21:22,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953705540] [2024-10-11 17:21:22,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:21:22,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:22,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:22,634 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:21:22,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 17:21:22,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-11 17:21:22,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:21:22,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 17:21:22,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:21:22,740 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-11 17:21:22,773 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:21:22,773 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-11 17:21:22,890 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-11 17:21:22,911 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-11 17:21:22,968 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-11 17:21:23,004 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-11 17:21:23,108 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 37 treesize of output 26 [2024-10-11 17:21:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:23,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:21:23,238 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse0)) 0)))) is different from false [2024-10-11 17:21:23,249 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) 0)))))) is different from false [2024-10-11 17:21:23,263 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~arg.base v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)))))) is different from false [2024-10-11 17:21:23,274 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse1)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)))))) is different from false [2024-10-11 17:21:23,285 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 1 .cse2)) (.cse3 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 2 .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_~ts~0#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4 0) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) (+ |c_ULTIMATE.start_main_~ts~0#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_1243 (Array Int Int))) (= (select (select (store .cse0 |c_threadThread1of1ForFork0_#in~arg.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~ts~0#1.base|) .cse4) 0)))))) is different from false [2024-10-11 17:21:23,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:23,295 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 4 case distinctions, treesize of input 51 treesize of output 67 [2024-10-11 17:21:23,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:21:23,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2024-10-11 17:21:23,302 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-11 17:21:23,306 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:23,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:21:23,311 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:23,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2024-10-11 17:21:23,315 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2024-10-11 17:21:23,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2024-10-11 17:21:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:23,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953705540] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:21:23,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:21:23,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 32 [2024-10-11 17:21:23,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027440115] [2024-10-11 17:21:23,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:21:23,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-11 17:21:23,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:23,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-11 17:21:23,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=657, Unknown=14, NotChecked=280, Total=1056 [2024-10-11 17:21:23,502 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 110 [2024-10-11 17:21:23,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 808 transitions, 16223 flow. Second operand has 33 states, 33 states have (on average 46.24242424242424) internal successors, (1526), 33 states have internal predecessors, (1526), 0 states have call successors, (0), 0 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-11 17:21:23,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:21:23,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 110 [2024-10-11 17:21:23,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:21:26,218 INFO L124 PetriNetUnfolderBase]: 2758/7952 cut-off events. [2024-10-11 17:21:26,218 INFO L125 PetriNetUnfolderBase]: For 85477/85503 co-relation queries the response was YES. [2024-10-11 17:21:26,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47853 conditions, 7952 events. 2758/7952 cut-off events. For 85477/85503 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 83317 event pairs, 359 based on Foata normal form. 17/7956 useless extension candidates. Maximal degree in co-relation 47624. Up to 3582 conditions per place. [2024-10-11 17:21:26,283 INFO L140 encePairwiseOnDemand]: 89/110 looper letters, 490 selfloop transitions, 426 changer transitions 7/967 dead transitions. [2024-10-11 17:21:26,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 967 transitions, 20577 flow [2024-10-11 17:21:26,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 17:21:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-10-11 17:21:26,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1044 transitions. [2024-10-11 17:21:26,285 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47454545454545455 [2024-10-11 17:21:26,285 INFO L175 Difference]: Start difference. First operand has 341 places, 808 transitions, 16223 flow. Second operand 20 states and 1044 transitions. [2024-10-11 17:21:26,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 967 transitions, 20577 flow [2024-10-11 17:21:26,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 967 transitions, 20228 flow, removed 132 selfloop flow, removed 16 redundant places. [2024-10-11 17:21:26,937 INFO L231 Difference]: Finished difference. Result has 351 places, 854 transitions, 19010 flow [2024-10-11 17:21:26,937 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=110, PETRI_DIFFERENCE_MINUEND_FLOW=15916, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=808, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=387, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=19010, PETRI_PLACES=351, PETRI_TRANSITIONS=854} [2024-10-11 17:21:26,938 INFO L277 CegarLoopForPetriNet]: 109 programPoint places, 242 predicate places. [2024-10-11 17:21:26,938 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 854 transitions, 19010 flow [2024-10-11 17:21:26,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 46.24242424242424) internal successors, (1526), 33 states have internal predecessors, (1526), 0 states have call successors, (0), 0 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-11 17:21:26,938 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:21:26,938 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] [2024-10-11 17:21:26,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-11 17:21:27,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 17:21:27,139 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-10-11 17:21:27,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:21:27,139 INFO L85 PathProgramCache]: Analyzing trace with hash 222509848, now seen corresponding path program 10 times [2024-10-11 17:21:27,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:21:27,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049236783] [2024-10-11 17:21:27,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:21:27,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:21:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:21:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:27,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:21:27,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049236783] [2024-10-11 17:21:27,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049236783] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:21:27,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258304811] [2024-10-11 17:21:27,427 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 17:21:27,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:21:27,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:21:27,429 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:21:27,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 17:21:27,604 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 17:21:27,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:21:27,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 17:21:27,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:21:27,611 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-11 17:21:27,652 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:21:27,652 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-11 17:21:27,830 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 15 treesize of output 11 [2024-10-11 17:21:27,892 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 28 treesize of output 27 [2024-10-11 17:21:27,923 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 40 treesize of output 42 [2024-10-11 17:21:28,033 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 52 treesize of output 57 [2024-10-11 17:21:28,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 60 [2024-10-11 17:21:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:28,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:21:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:21:43,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258304811] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:21:43,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:21:43,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2024-10-11 17:21:43,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378648038] [2024-10-11 17:21:43,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:21:43,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-11 17:21:43,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:21:43,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-11 17:21:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1317, Unknown=3, NotChecked=0, Total=1482 [2024-10-11 17:21:47,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-11 17:21:52,467 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 [1] [2024-10-11 17:21:59,662 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 [1] [2024-10-11 17:22:03,786 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 [1] [2024-10-11 17:22:08,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]