./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:41:52,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:41:52,511 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:41:52,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:41:52,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:41:52,560 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:41:52,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:41:52,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:41:52,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:41:52,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:41:52,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:41:52,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:41:52,566 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:41:52,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:41:52,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:41:52,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:41:52,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:41:52,569 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:41:52,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:41:52,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:41:52,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:41:52,574 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:41:52,574 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:41:52,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:41:52,575 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:41:52,575 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:41:52,575 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:41:52,576 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:41:52,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:41:52,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:41:52,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:41:52,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:41:52,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:41:52,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:41:52,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:41:52,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:41:52,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:41:52,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:41:52,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:41:52,579 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:41:52,579 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:41:52,580 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16badef15fc63e9ddc5177a1b2c95333295e395a70b18e0490e8c8921933ac0e [2024-11-10 14:41:52,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:41:52,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:41:52,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:41:52,895 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:41:52,896 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:41:52,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2024-11-10 14:41:54,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:41:54,760 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:41:54,762 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-array-init.i [2024-11-10 14:41:54,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d81463a3b/b1b1dc2eb5fe4ec089feabc683635553/FLAG44dae1f16 [2024-11-10 14:41:55,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d81463a3b/b1b1dc2eb5fe4ec089feabc683635553 [2024-11-10 14:41:55,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:41:55,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:41:55,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:41:55,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:41:55,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:41:55,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:41:55" (1/1) ... [2024-11-10 14:41:55,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d7068b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:55, skipping insertion in model container [2024-11-10 14:41:55,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:41:55" (1/1) ... [2024-11-10 14:41:55,074 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:41:55,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:41:55,532 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:41:55,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:41:55,647 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:41:55,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:55 WrapperNode [2024-11-10 14:41:55,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:41:55,649 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:41:55,649 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:41:55,649 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:41:55,656 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:55" (1/1) ... [2024-11-10 14:41:55,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:55" (1/1) ... [2024-11-10 14:41:55,706 INFO L138 Inliner]: procedures = 261, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2024-11-10 14:41:55,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:41:55,711 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:41:55,711 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:41:55,712 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:41:55,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:55" (1/1) ... [2024-11-10 14:41:55,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:55" (1/1) ... [2024-11-10 14:41:55,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:55" (1/1) ... [2024-11-10 14:41:55,731 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:55" (1/1) ... [2024-11-10 14:41:55,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:55" (1/1) ... [2024-11-10 14:41:55,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:55" (1/1) ... [2024-11-10 14:41:55,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:55" (1/1) ... [2024-11-10 14:41:55,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:55" (1/1) ... [2024-11-10 14:41:55,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:41:55,759 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:41:55,760 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:41:55,760 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:41:55,761 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:55" (1/1) ... [2024-11-10 14:41:55,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:41:55,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:41:55,794 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:41:55,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:41:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:41:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:41:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:41:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:41:55,836 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-10 14:41:55,837 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-10 14:41:55,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:41:55,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:41:55,838 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:41:55,962 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:41:55,964 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:41:56,276 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:41:56,276 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:41:56,291 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:41:56,291 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:41:56,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:41:56 BoogieIcfgContainer [2024-11-10 14:41:56,292 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:41:56,294 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:41:56,294 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:41:56,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:41:56,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:41:55" (1/3) ... [2024-11-10 14:41:56,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619f824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:41:56, skipping insertion in model container [2024-11-10 14:41:56,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:41:55" (2/3) ... [2024-11-10 14:41:56,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@619f824 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:41:56, skipping insertion in model container [2024-11-10 14:41:56,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:41:56" (3/3) ... [2024-11-10 14:41:56,300 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-array-init.i [2024-11-10 14:41:56,319 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:41:56,319 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 14:41:56,320 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:41:56,374 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:41:56,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 92 transitions, 191 flow [2024-11-10 14:41:56,466 INFO L124 PetriNetUnfolderBase]: 6/135 cut-off events. [2024-11-10 14:41:56,466 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:41:56,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 135 events. 6/135 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 197 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 66. Up to 4 conditions per place. [2024-11-10 14:41:56,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 92 transitions, 191 flow [2024-11-10 14:41:56,479 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 92 transitions, 191 flow [2024-11-10 14:41:56,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:41:56,504 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;@1b93f6ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:41:56,505 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 14:41:56,520 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:41:56,520 INFO L124 PetriNetUnfolderBase]: 3/47 cut-off events. [2024-11-10 14:41:56,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:41:56,521 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:56,522 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] [2024-11-10 14:41:56,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:41:56,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:56,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1853320919, now seen corresponding path program 1 times [2024-11-10 14:41:56,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:56,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836159316] [2024-11-10 14:41:56,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:56,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:57,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:41:57,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:57,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836159316] [2024-11-10 14:41:57,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836159316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:57,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:57,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:41:57,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286865086] [2024-11-10 14:41:57,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:57,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:41:57,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:57,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:41:57,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:41:57,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 92 [2024-11-10 14:41:57,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 62.5) internal successors, (375), 6 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:41:57,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:57,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 92 [2024-11-10 14:41:57,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:41:57,937 INFO L124 PetriNetUnfolderBase]: 91/422 cut-off events. [2024-11-10 14:41:57,937 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:41:57,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 658 conditions, 422 events. 91/422 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2039 event pairs, 52 based on Foata normal form. 13/398 useless extension candidates. Maximal degree in co-relation 561. Up to 197 conditions per place. [2024-11-10 14:41:57,943 INFO L140 encePairwiseOnDemand]: 78/92 looper letters, 27 selfloop transitions, 22 changer transitions 1/110 dead transitions. [2024-11-10 14:41:57,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 110 transitions, 325 flow [2024-11-10 14:41:57,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:41:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:41:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 419 transitions. [2024-11-10 14:41:57,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7590579710144928 [2024-11-10 14:41:57,964 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 191 flow. Second operand 6 states and 419 transitions. [2024-11-10 14:41:57,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 110 transitions, 325 flow [2024-11-10 14:41:57,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 110 transitions, 325 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:41:57,974 INFO L231 Difference]: Finished difference. Result has 101 places, 109 transitions, 333 flow [2024-11-10 14:41:57,977 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=333, PETRI_PLACES=101, PETRI_TRANSITIONS=109} [2024-11-10 14:41:57,982 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 10 predicate places. [2024-11-10 14:41:57,983 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 109 transitions, 333 flow [2024-11-10 14:41:57,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 62.5) internal successors, (375), 6 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:41:57,984 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:57,984 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] [2024-11-10 14:41:57,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:41:57,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:41:57,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash -540908802, now seen corresponding path program 1 times [2024-11-10 14:41:57,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:57,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367956950] [2024-11-10 14:41:57,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:57,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:41:58,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:58,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367956950] [2024-11-10 14:41:58,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367956950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:58,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:58,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:41:58,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727115011] [2024-11-10 14:41:58,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:58,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:41:58,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:58,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:41:58,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:41:58,236 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 92 [2024-11-10 14:41:58,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 109 transitions, 333 flow. Second operand has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:41:58,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:58,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 92 [2024-11-10 14:41:58,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:41:58,286 INFO L124 PetriNetUnfolderBase]: 40/258 cut-off events. [2024-11-10 14:41:58,286 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-10 14:41:58,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 258 events. 40/258 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 847 event pairs, 4 based on Foata normal form. 1/244 useless extension candidates. Maximal degree in co-relation 335. Up to 50 conditions per place. [2024-11-10 14:41:58,288 INFO L140 encePairwiseOnDemand]: 84/92 looper letters, 11 selfloop transitions, 2 changer transitions 5/114 dead transitions. [2024-11-10 14:41:58,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 114 transitions, 379 flow [2024-11-10 14:41:58,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:41:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:41:58,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 475 transitions. [2024-11-10 14:41:58,291 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8605072463768116 [2024-11-10 14:41:58,292 INFO L175 Difference]: Start difference. First operand has 101 places, 109 transitions, 333 flow. Second operand 6 states and 475 transitions. [2024-11-10 14:41:58,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 114 transitions, 379 flow [2024-11-10 14:41:58,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 114 transitions, 379 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:41:58,297 INFO L231 Difference]: Finished difference. Result has 109 places, 109 transitions, 351 flow [2024-11-10 14:41:58,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=109, PETRI_TRANSITIONS=109} [2024-11-10 14:41:58,298 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 18 predicate places. [2024-11-10 14:41:58,298 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 109 transitions, 351 flow [2024-11-10 14:41:58,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.4) internal successors, (387), 5 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:41:58,299 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:58,299 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] [2024-11-10 14:41:58,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:41:58,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:41:58,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:58,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1575483189, now seen corresponding path program 1 times [2024-11-10 14:41:58,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:58,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715736573] [2024-11-10 14:41:58,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:58,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:41:58,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:58,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715736573] [2024-11-10 14:41:58,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715736573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:58,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:58,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:41:58,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164028106] [2024-11-10 14:41:58,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:58,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:41:58,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:58,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:41:58,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:41:58,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 92 [2024-11-10 14:41:58,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 109 transitions, 351 flow. Second operand has 6 states, 6 states have (on average 63.166666666666664) internal successors, (379), 6 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:41:58,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:58,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 92 [2024-11-10 14:41:58,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:41:58,982 INFO L124 PetriNetUnfolderBase]: 109/473 cut-off events. [2024-11-10 14:41:58,983 INFO L125 PetriNetUnfolderBase]: For 104/109 co-relation queries the response was YES. [2024-11-10 14:41:58,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 473 events. 109/473 cut-off events. For 104/109 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2292 event pairs, 36 based on Foata normal form. 0/439 useless extension candidates. Maximal degree in co-relation 888. Up to 225 conditions per place. [2024-11-10 14:41:58,989 INFO L140 encePairwiseOnDemand]: 81/92 looper letters, 46 selfloop transitions, 22 changer transitions 0/130 dead transitions. [2024-11-10 14:41:58,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 130 transitions, 561 flow [2024-11-10 14:41:58,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:41:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:41:58,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 416 transitions. [2024-11-10 14:41:58,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7536231884057971 [2024-11-10 14:41:58,992 INFO L175 Difference]: Start difference. First operand has 109 places, 109 transitions, 351 flow. Second operand 6 states and 416 transitions. [2024-11-10 14:41:58,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 130 transitions, 561 flow [2024-11-10 14:41:58,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 130 transitions, 547 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-11-10 14:41:59,000 INFO L231 Difference]: Finished difference. Result has 111 places, 130 transitions, 519 flow [2024-11-10 14:41:59,001 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=519, PETRI_PLACES=111, PETRI_TRANSITIONS=130} [2024-11-10 14:41:59,001 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 20 predicate places. [2024-11-10 14:41:59,002 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 130 transitions, 519 flow [2024-11-10 14:41:59,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.166666666666664) internal successors, (379), 6 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:41:59,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:59,002 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] [2024-11-10 14:41:59,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:41:59,003 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:41:59,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:59,004 INFO L85 PathProgramCache]: Analyzing trace with hash -322647616, now seen corresponding path program 1 times [2024-11-10 14:41:59,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:59,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136766095] [2024-11-10 14:41:59,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:59,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:41:59,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:59,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136766095] [2024-11-10 14:41:59,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136766095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:59,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:59,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:41:59,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338699139] [2024-11-10 14:41:59,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:59,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:41:59,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:59,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:41:59,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:41:59,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 92 [2024-11-10 14:41:59,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 130 transitions, 519 flow. Second operand has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:41:59,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:41:59,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 92 [2024-11-10 14:41:59,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:41:59,602 INFO L124 PetriNetUnfolderBase]: 140/589 cut-off events. [2024-11-10 14:41:59,603 INFO L125 PetriNetUnfolderBase]: For 349/383 co-relation queries the response was YES. [2024-11-10 14:41:59,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1504 conditions, 589 events. 140/589 cut-off events. For 349/383 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3032 event pairs, 14 based on Foata normal form. 4/566 useless extension candidates. Maximal degree in co-relation 1384. Up to 232 conditions per place. [2024-11-10 14:41:59,610 INFO L140 encePairwiseOnDemand]: 78/92 looper letters, 46 selfloop transitions, 57 changer transitions 8/178 dead transitions. [2024-11-10 14:41:59,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 178 transitions, 967 flow [2024-11-10 14:41:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:41:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:41:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 486 transitions. [2024-11-10 14:41:59,613 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8804347826086957 [2024-11-10 14:41:59,613 INFO L175 Difference]: Start difference. First operand has 111 places, 130 transitions, 519 flow. Second operand 6 states and 486 transitions. [2024-11-10 14:41:59,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 178 transitions, 967 flow [2024-11-10 14:41:59,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 178 transitions, 929 flow, removed 19 selfloop flow, removed 0 redundant places. [2024-11-10 14:41:59,624 INFO L231 Difference]: Finished difference. Result has 121 places, 170 transitions, 985 flow [2024-11-10 14:41:59,626 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=985, PETRI_PLACES=121, PETRI_TRANSITIONS=170} [2024-11-10 14:41:59,627 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 30 predicate places. [2024-11-10 14:41:59,627 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 170 transitions, 985 flow [2024-11-10 14:41:59,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:41:59,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:41:59,629 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:41:59,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:41:59,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:41:59,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:41:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1323962435, now seen corresponding path program 1 times [2024-11-10 14:41:59,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:41:59,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771240947] [2024-11-10 14:41:59,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:41:59,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:41:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:41:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:41:59,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:41:59,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771240947] [2024-11-10 14:41:59,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771240947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:41:59,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:41:59,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:41:59,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941942809] [2024-11-10 14:41:59,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:41:59,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:41:59,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:41:59,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:41:59,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:42:00,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 92 [2024-11-10 14:42:00,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 170 transitions, 985 flow. Second operand has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:42:00,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:00,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 92 [2024-11-10 14:42:00,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:00,213 INFO L124 PetriNetUnfolderBase]: 125/540 cut-off events. [2024-11-10 14:42:00,213 INFO L125 PetriNetUnfolderBase]: For 695/720 co-relation queries the response was YES. [2024-11-10 14:42:00,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 540 events. 125/540 cut-off events. For 695/720 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2795 event pairs, 6 based on Foata normal form. 0/540 useless extension candidates. Maximal degree in co-relation 1503. Up to 135 conditions per place. [2024-11-10 14:42:00,218 INFO L140 encePairwiseOnDemand]: 86/92 looper letters, 55 selfloop transitions, 0 changer transitions 16/169 dead transitions. [2024-11-10 14:42:00,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 169 transitions, 1109 flow [2024-11-10 14:42:00,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:42:00,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:42:00,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 422 transitions. [2024-11-10 14:42:00,220 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7644927536231884 [2024-11-10 14:42:00,220 INFO L175 Difference]: Start difference. First operand has 121 places, 170 transitions, 985 flow. Second operand 6 states and 422 transitions. [2024-11-10 14:42:00,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 169 transitions, 1109 flow [2024-11-10 14:42:00,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 169 transitions, 1073 flow, removed 18 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:00,231 INFO L231 Difference]: Finished difference. Result has 117 places, 153 transitions, 910 flow [2024-11-10 14:42:00,232 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=947, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=910, PETRI_PLACES=117, PETRI_TRANSITIONS=153} [2024-11-10 14:42:00,233 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 26 predicate places. [2024-11-10 14:42:00,233 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 153 transitions, 910 flow [2024-11-10 14:42:00,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:42:00,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:00,234 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:00,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:42:00,234 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:42:00,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:00,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1640787380, now seen corresponding path program 1 times [2024-11-10 14:42:00,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:00,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431043287] [2024-11-10 14:42:00,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:00,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:01,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:01,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431043287] [2024-11-10 14:42:01,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431043287] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:42:01,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078994837] [2024-11-10 14:42:01,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:01,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:42:01,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:42:01,229 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:42:01,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 14:42:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:01,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 14:42:01,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:42:01,559 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 15 treesize of output 11 [2024-11-10 14:42:01,724 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 28 treesize of output 27 [2024-11-10 14:42:01,786 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 0 case distinctions, treesize of input 40 treesize of output 42 [2024-11-10 14:42:01,881 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 0 case distinctions, treesize of input 52 treesize of output 57 [2024-11-10 14:42:01,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:01,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:01,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:01,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:01,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:42:01,968 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 59 treesize of output 67 [2024-11-10 14:42:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:02,054 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:42:02,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078994837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:02,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:42:02,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2024-11-10 14:42:02,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638834060] [2024-11-10 14:42:02,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:02,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 14:42:02,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:02,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 14:42:02,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2024-11-10 14:42:02,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 92 [2024-11-10 14:42:02,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 153 transitions, 910 flow. Second operand has 12 states, 12 states have (on average 58.25) internal successors, (699), 12 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:42:02,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:02,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 92 [2024-11-10 14:42:02,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:03,364 INFO L124 PetriNetUnfolderBase]: 286/938 cut-off events. [2024-11-10 14:42:03,364 INFO L125 PetriNetUnfolderBase]: For 1100/1121 co-relation queries the response was YES. [2024-11-10 14:42:03,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3207 conditions, 938 events. 286/938 cut-off events. For 1100/1121 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5451 event pairs, 15 based on Foata normal form. 10/945 useless extension candidates. Maximal degree in co-relation 3187. Up to 347 conditions per place. [2024-11-10 14:42:03,373 INFO L140 encePairwiseOnDemand]: 74/92 looper letters, 187 selfloop transitions, 61 changer transitions 0/287 dead transitions. [2024-11-10 14:42:03,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 287 transitions, 2368 flow [2024-11-10 14:42:03,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 14:42:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-10 14:42:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 842 transitions. [2024-11-10 14:42:03,376 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7040133779264214 [2024-11-10 14:42:03,376 INFO L175 Difference]: Start difference. First operand has 117 places, 153 transitions, 910 flow. Second operand 13 states and 842 transitions. [2024-11-10 14:42:03,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 287 transitions, 2368 flow [2024-11-10 14:42:03,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 287 transitions, 2366 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:42:03,390 INFO L231 Difference]: Finished difference. Result has 117 places, 197 transitions, 1521 flow [2024-11-10 14:42:03,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1521, PETRI_PLACES=117, PETRI_TRANSITIONS=197} [2024-11-10 14:42:03,391 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 26 predicate places. [2024-11-10 14:42:03,392 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 197 transitions, 1521 flow [2024-11-10 14:42:03,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 58.25) internal successors, (699), 12 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:42:03,392 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:03,392 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:03,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 14:42:03,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 14:42:03,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:42:03,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:03,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1588719830, now seen corresponding path program 1 times [2024-11-10 14:42:03,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:03,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129851211] [2024-11-10 14:42:03,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:03,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:04,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:04,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129851211] [2024-11-10 14:42:04,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129851211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:42:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155220576] [2024-11-10 14:42:04,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:04,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:42:04,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:42:04,384 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:42:04,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 14:42:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:04,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 14:42:04,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:42:04,559 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-11-10 14:42:04,591 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-11-10 14:42:04,628 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 0 case distinctions, treesize of input 30 treesize of output 32 [2024-11-10 14:42:04,674 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 0 case distinctions, treesize of input 39 treesize of output 44 [2024-11-10 14:42:04,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:04,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:04,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:04,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:04,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:42:04,915 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 58 treesize of output 47 [2024-11-10 14:42:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:04,930 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:42:04,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155220576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:04,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:42:04,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2024-11-10 14:42:04,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212935085] [2024-11-10 14:42:04,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:04,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 14:42:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:04,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 14:42:04,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2024-11-10 14:42:05,415 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 92 [2024-11-10 14:42:05,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 197 transitions, 1521 flow. Second operand has 12 states, 12 states have (on average 64.91666666666667) internal successors, (779), 12 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:42:05,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:05,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 92 [2024-11-10 14:42:05,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:06,015 INFO L124 PetriNetUnfolderBase]: 269/1007 cut-off events. [2024-11-10 14:42:06,016 INFO L125 PetriNetUnfolderBase]: For 2075/2120 co-relation queries the response was YES. [2024-11-10 14:42:06,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3824 conditions, 1007 events. 269/1007 cut-off events. For 2075/2120 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 6402 event pairs, 18 based on Foata normal form. 7/1010 useless extension candidates. Maximal degree in co-relation 3796. Up to 453 conditions per place. [2024-11-10 14:42:06,027 INFO L140 encePairwiseOnDemand]: 72/92 looper letters, 153 selfloop transitions, 45 changer transitions 0/253 dead transitions. [2024-11-10 14:42:06,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 253 transitions, 2347 flow [2024-11-10 14:42:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 14:42:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-10 14:42:06,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1016 transitions. [2024-11-10 14:42:06,030 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.736231884057971 [2024-11-10 14:42:06,030 INFO L175 Difference]: Start difference. First operand has 117 places, 197 transitions, 1521 flow. Second operand 15 states and 1016 transitions. [2024-11-10 14:42:06,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 253 transitions, 2347 flow [2024-11-10 14:42:06,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 253 transitions, 2312 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 14:42:06,054 INFO L231 Difference]: Finished difference. Result has 138 places, 235 transitions, 2028 flow [2024-11-10 14:42:06,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=1514, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2028, PETRI_PLACES=138, PETRI_TRANSITIONS=235} [2024-11-10 14:42:06,055 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 47 predicate places. [2024-11-10 14:42:06,055 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 235 transitions, 2028 flow [2024-11-10 14:42:06,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 64.91666666666667) internal successors, (779), 12 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:42:06,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:06,056 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:06,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 14:42:06,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-10 14:42:06,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:42:06,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:06,261 INFO L85 PathProgramCache]: Analyzing trace with hash 474387116, now seen corresponding path program 2 times [2024-11-10 14:42:06,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:06,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077268642] [2024-11-10 14:42:06,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:06,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:07,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:07,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077268642] [2024-11-10 14:42:07,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077268642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:42:07,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303902970] [2024-11-10 14:42:07,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:42:07,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:42:07,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:42:07,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:42:07,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 14:42:07,190 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:42:07,191 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:42:07,193 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 14:42:07,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:42:07,349 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 15 treesize of output 11 [2024-11-10 14:42:07,387 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 28 treesize of output 27 [2024-11-10 14:42:07,437 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 0 case distinctions, treesize of input 40 treesize of output 42 [2024-11-10 14:42:07,506 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 0 case distinctions, treesize of input 52 treesize of output 57 [2024-11-10 14:42:07,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:07,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:07,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:07,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:07,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:42:07,604 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 59 treesize of output 67 [2024-11-10 14:42:07,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:07,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:42:07,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303902970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:07,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:42:07,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2024-11-10 14:42:07,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623599580] [2024-11-10 14:42:07,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:07,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 14:42:07,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:07,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 14:42:07,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2024-11-10 14:42:08,390 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 92 [2024-11-10 14:42:08,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 235 transitions, 2028 flow. Second operand has 12 states, 12 states have (on average 58.25) internal successors, (699), 12 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:42:08,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:08,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 92 [2024-11-10 14:42:08,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:09,459 INFO L124 PetriNetUnfolderBase]: 632/2190 cut-off events. [2024-11-10 14:42:09,460 INFO L125 PetriNetUnfolderBase]: For 6328/6397 co-relation queries the response was YES. [2024-11-10 14:42:09,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9289 conditions, 2190 events. 632/2190 cut-off events. For 6328/6397 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 17218 event pairs, 50 based on Foata normal form. 13/2198 useless extension candidates. Maximal degree in co-relation 9251. Up to 634 conditions per place. [2024-11-10 14:42:09,488 INFO L140 encePairwiseOnDemand]: 78/92 looper letters, 439 selfloop transitions, 65 changer transitions 0/543 dead transitions. [2024-11-10 14:42:09,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 543 transitions, 6054 flow [2024-11-10 14:42:09,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 14:42:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-10 14:42:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1025 transitions. [2024-11-10 14:42:09,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6963315217391305 [2024-11-10 14:42:09,491 INFO L175 Difference]: Start difference. First operand has 138 places, 235 transitions, 2028 flow. Second operand 16 states and 1025 transitions. [2024-11-10 14:42:09,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 543 transitions, 6054 flow [2024-11-10 14:42:09,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 543 transitions, 6004 flow, removed 25 selfloop flow, removed 0 redundant places. [2024-11-10 14:42:09,562 INFO L231 Difference]: Finished difference. Result has 162 places, 288 transitions, 2814 flow [2024-11-10 14:42:09,562 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2814, PETRI_PLACES=162, PETRI_TRANSITIONS=288} [2024-11-10 14:42:09,563 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 71 predicate places. [2024-11-10 14:42:09,563 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 288 transitions, 2814 flow [2024-11-10 14:42:09,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 58.25) internal successors, (699), 12 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:42:09,564 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:09,564 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:09,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 14:42:09,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:42:09,769 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:42:09,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:09,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1651098922, now seen corresponding path program 3 times [2024-11-10 14:42:09,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:09,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622845261] [2024-11-10 14:42:09,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:09,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:10,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:10,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622845261] [2024-11-10 14:42:10,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622845261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:42:10,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825140149] [2024-11-10 14:42:10,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 14:42:10,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:42:10,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:42:10,521 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:42:10,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 14:42:10,622 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 14:42:10,622 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:42:10,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 14:42:10,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:42:10,777 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 15 treesize of output 11 [2024-11-10 14:42:10,822 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 28 treesize of output 27 [2024-11-10 14:42:10,870 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 0 case distinctions, treesize of input 40 treesize of output 42 [2024-11-10 14:42:10,921 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 0 case distinctions, treesize of input 52 treesize of output 57 [2024-11-10 14:42:10,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:10,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:10,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:10,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:10,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:42:10,992 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 59 treesize of output 67 [2024-11-10 14:42:11,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:11,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:42:11,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825140149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:42:11,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:42:11,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2024-11-10 14:42:11,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632609385] [2024-11-10 14:42:11,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:11,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 14:42:11,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:11,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 14:42:11,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2024-11-10 14:42:11,571 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 92 [2024-11-10 14:42:11,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 288 transitions, 2814 flow. Second operand has 12 states, 12 states have (on average 58.25) internal successors, (699), 12 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:42:11,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:42:11,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 92 [2024-11-10 14:42:11,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:42:12,812 INFO L124 PetriNetUnfolderBase]: 775/2688 cut-off events. [2024-11-10 14:42:12,812 INFO L125 PetriNetUnfolderBase]: For 9874/9968 co-relation queries the response was YES. [2024-11-10 14:42:12,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12172 conditions, 2688 events. 775/2688 cut-off events. For 9874/9968 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 22603 event pairs, 82 based on Foata normal form. 13/2692 useless extension candidates. Maximal degree in co-relation 12124. Up to 1359 conditions per place. [2024-11-10 14:42:12,843 INFO L140 encePairwiseOnDemand]: 78/92 looper letters, 382 selfloop transitions, 57 changer transitions 0/478 dead transitions. [2024-11-10 14:42:12,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 478 transitions, 5659 flow [2024-11-10 14:42:12,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 14:42:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-10 14:42:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 832 transitions. [2024-11-10 14:42:12,846 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6956521739130435 [2024-11-10 14:42:12,846 INFO L175 Difference]: Start difference. First operand has 162 places, 288 transitions, 2814 flow. Second operand 13 states and 832 transitions. [2024-11-10 14:42:12,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 478 transitions, 5659 flow [2024-11-10 14:42:12,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 478 transitions, 5597 flow, removed 29 selfloop flow, removed 1 redundant places. [2024-11-10 14:42:12,950 INFO L231 Difference]: Finished difference. Result has 181 places, 331 transitions, 3559 flow [2024-11-10 14:42:12,951 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=2759, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3559, PETRI_PLACES=181, PETRI_TRANSITIONS=331} [2024-11-10 14:42:12,953 INFO L277 CegarLoopForPetriNet]: 91 programPoint places, 90 predicate places. [2024-11-10 14:42:12,953 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 331 transitions, 3559 flow [2024-11-10 14:42:12,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 58.25) internal successors, (699), 12 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:42:12,954 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:42:12,954 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:42:12,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 14:42:13,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:42:13,155 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:42:13,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:42:13,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1267974758, now seen corresponding path program 2 times [2024-11-10 14:42:13,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:42:13,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302513048] [2024-11-10 14:42:13,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:42:13,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:42:13,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:42:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:13,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:42:13,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302513048] [2024-11-10 14:42:13,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302513048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:42:13,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705971858] [2024-11-10 14:42:13,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:42:13,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:42:13,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:42:13,711 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 14:42:13,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 14:42:13,796 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:42:13,796 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:42:13,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-10 14:42:13,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:42:14,004 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-11-10 14:42:14,043 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-11-10 14:42:14,084 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 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-10 14:42:14,177 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 0 case distinctions, treesize of input 33 treesize of output 38 [2024-11-10 14:42:14,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:42:14,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 14:42:14,334 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-11-10 14:42:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:14,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:42:24,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:42:24,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705971858] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 14:42:24,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:42:24,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12, 14] total 34 [2024-11-10 14:42:24,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928302033] [2024-11-10 14:42:24,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:42:24,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 14:42:24,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:42:24,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 14:42:24,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1014, Unknown=1, NotChecked=0, Total=1190 [2024-11-10 14:42:29,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:42:37,699 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-11-10 14:42:43,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:42:47,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:42:50,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:42:54,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:42:59,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:43:01,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:43:02,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:43:08,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:43:08,639 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 92 [2024-11-10 14:43:08,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 331 transitions, 3559 flow. Second operand has 12 states, 12 states have (on average 60.083333333333336) internal successors, (721), 12 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:43:08,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:08,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 92 [2024-11-10 14:43:08,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:19,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:43:23,969 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_threadThread1of1ForFork0_~p~0.offset 3))) (let ((.cse3 (store |c_#race| c_threadThread1of1ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of1ForFork0_~p~0.base) .cse5 0)))) (let ((.cse7 (+ c_threadThread1of1ForFork0_~p~0.offset 2)) (.cse8 (* (- 1) |c_ULTIMATE.start_main_~is~0#1.offset|)) (.cse4 (select .cse3 |c_ULTIMATE.start_main_~is~0#1.base|)) (.cse1 (+ c_threadThread1of1ForFork0_~p~0.offset 1)) (.cse6 (+ |c_ULTIMATE.start_main_~i~1#1| 1)) (.cse0 (select |c_#race| |c_ULTIMATE.start_main_~is~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_#t~post11#1| 1))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int)) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~is~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) .cse1) 0)) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse2))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int) (|ULTIMATE.start_main_#t~nondet7#1| Int)) (or (= (select (select (store .cse3 |c_ULTIMATE.start_main_~is~0#1.base| (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int)) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~is~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0)) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse2))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int) (|ULTIMATE.start_main_#t~nondet7#1| Int)) (or (= (select (select (store .cse3 |c_ULTIMATE.start_main_~is~0#1.base| (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) .cse7) 0) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int)) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~is~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) .cse5) 0)) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse2))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int) (|ULTIMATE.start_main_#t~nondet7#1| Int)) (or (= (select (select (store .cse3 |c_ULTIMATE.start_main_~is~0#1.base| (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) 0) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse6))) (or (< (div (+ 3 .cse8 |c_threadThread1of1ForFork0_#in~arg.offset|) 4) .cse6) (not (= |c_threadThread1of1ForFork0_#in~arg.base| |c_ULTIMATE.start_main_~is~0#1.base|))) (or (not (= c_threadThread1of1ForFork0_~arg.base |c_ULTIMATE.start_main_~is~0#1.base|)) (< (div (+ c_threadThread1of1ForFork0_~arg.offset 3 .cse8) 4) .cse6)) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int) (|ULTIMATE.start_main_#t~nondet7#1| Int)) (or (= 0 (select (select (store .cse3 |c_ULTIMATE.start_main_~is~0#1.base| (store .cse4 (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) .cse1)) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse6))) (forall ((|v_ULTIMATE.start_main_~i~1#1_25| Int)) (or (forall ((|ULTIMATE.start_main_#t~nondet7#1| Int)) (= 0 (select (select (store |c_#race| |c_ULTIMATE.start_main_~is~0#1.base| (store .cse0 (+ (* |v_ULTIMATE.start_main_~i~1#1_25| 4) |c_ULTIMATE.start_main_~is~0#1.offset|) |ULTIMATE.start_main_#t~nondet7#1|)) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset))) (< |v_ULTIMATE.start_main_~i~1#1_25| .cse2))))))) is different from false