./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-2.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/thread-join-array-const-race-2.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 860528881155a718438c0581485d42cc235131c30c9ba38f0a976304f206e75d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:43:40,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:43:40,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:43:40,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:43:40,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:43:40,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:43:40,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:43:40,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:43:40,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:43:40,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:43:40,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:43:40,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:43:40,664 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:43:40,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:43:40,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:43:40,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:43:40,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:43:40,666 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:43:40,666 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:43:40,666 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:43:40,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:43:40,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:43:40,670 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:43:40,670 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:43:40,670 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:43:40,670 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:43:40,670 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:43:40,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:43:40,671 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:43:40,671 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:43:40,671 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:43:40,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:43:40,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:43:40,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:43:40,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:43:40,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:43:40,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:43:40,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:43:40,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:43:40,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:43:40,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:43:40,673 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 -> 860528881155a718438c0581485d42cc235131c30c9ba38f0a976304f206e75d [2024-11-10 14:43:40,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:43:40,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:43:40,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:43:40,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:43:40,910 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:43:40,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-2.i [2024-11-10 14:43:42,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:43:42,254 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:43:42,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/thread-join-array-const-race-2.i [2024-11-10 14:43:42,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18646ffe8/fc64bd9c820b48ea8c459403ac40f2c6/FLAG0876d5c61 [2024-11-10 14:43:42,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18646ffe8/fc64bd9c820b48ea8c459403ac40f2c6 [2024-11-10 14:43:42,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:43:42,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:43:42,631 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:43:42,631 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:43:42,636 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:43:42,637 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:43:42" (1/1) ... [2024-11-10 14:43:42,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d5c5182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:42, skipping insertion in model container [2024-11-10 14:43:42,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:43:42" (1/1) ... [2024-11-10 14:43:42,671 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:43:42,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:43:42,959 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:43:42,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:43:43,025 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:43:43,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:43 WrapperNode [2024-11-10 14:43:43,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:43:43,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:43:43,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:43:43,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:43:43,031 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:43:43" (1/1) ... [2024-11-10 14:43:43,042 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:43:43" (1/1) ... [2024-11-10 14:43:43,065 INFO L138 Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2024-11-10 14:43:43,065 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:43:43,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:43:43,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:43:43,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:43:43,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:43" (1/1) ... [2024-11-10 14:43:43,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:43" (1/1) ... [2024-11-10 14:43:43,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:43" (1/1) ... [2024-11-10 14:43:43,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:43" (1/1) ... [2024-11-10 14:43:43,078 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:43" (1/1) ... [2024-11-10 14:43:43,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:43" (1/1) ... [2024-11-10 14:43:43,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:43" (1/1) ... [2024-11-10 14:43:43,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:43" (1/1) ... [2024-11-10 14:43:43,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:43:43,086 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:43:43,086 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:43:43,086 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:43:43,090 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:43" (1/1) ... [2024-11-10 14:43:43,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:43:43,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:43:43,116 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:43:43,119 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:43:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:43:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:43:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:43:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:43:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:43:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:43:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:43:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-11-10 14:43:43,149 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-11-10 14:43:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:43:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:43:43,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:43:43,151 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:43:43,276 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:43:43,278 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:43:43,388 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L691: havoc main_~#tids~0#1.base, main_~#tids~0#1.offset; [2024-11-10 14:43:43,388 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L691-1: SUMMARY for call ULTIMATE.dealloc(main_~#tids~0#1.base, main_~#tids~0#1.offset); srcloc: null [2024-11-10 14:43:43,413 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:43:43,414 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:43:43,438 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:43:43,438 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:43:43,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:43:43 BoogieIcfgContainer [2024-11-10 14:43:43,438 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:43:43,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:43:43,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:43:43,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:43:43,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:43:42" (1/3) ... [2024-11-10 14:43:43,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b4d75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:43:43, skipping insertion in model container [2024-11-10 14:43:43,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:43:43" (2/3) ... [2024-11-10 14:43:43,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66b4d75b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:43:43, skipping insertion in model container [2024-11-10 14:43:43,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:43:43" (3/3) ... [2024-11-10 14:43:43,446 INFO L112 eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-2.i [2024-11-10 14:43:43,458 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:43:43,458 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 14:43:43,458 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:43:43,502 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:43:43,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 79 transitions, 165 flow [2024-11-10 14:43:43,557 INFO L124 PetriNetUnfolderBase]: 5/116 cut-off events. [2024-11-10 14:43:43,557 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:43:43,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 116 events. 5/116 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 228 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 59. Up to 4 conditions per place. [2024-11-10 14:43:43,560 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 79 transitions, 165 flow [2024-11-10 14:43:43,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 79 transitions, 165 flow [2024-11-10 14:43:43,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:43:43,576 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;@60123bb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:43:43,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-10 14:43:43,590 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:43:43,590 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-10 14:43:43,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:43:43,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:43,591 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] [2024-11-10 14:43:43,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:43:43,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash 47149494, now seen corresponding path program 1 times [2024-11-10 14:43:43,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:43,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175376602] [2024-11-10 14:43:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:43,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:43,761 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:43:43,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:43,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175376602] [2024-11-10 14:43:43,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175376602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:43,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:43,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:43,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703338909] [2024-11-10 14:43:43,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:43,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:43:43,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:43,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:43:43,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:43:43,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 79 [2024-11-10 14:43:43,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 165 flow. Second operand has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 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:43,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:43,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 79 [2024-11-10 14:43:43,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:43,840 INFO L124 PetriNetUnfolderBase]: 1/112 cut-off events. [2024-11-10 14:43:43,840 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-11-10 14:43:43,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122 conditions, 112 events. 1/112 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 212 event pairs, 0 based on Foata normal form. 6/107 useless extension candidates. Maximal degree in co-relation 2. Up to 5 conditions per place. [2024-11-10 14:43:43,841 INFO L140 encePairwiseOnDemand]: 77/79 looper letters, 4 selfloop transitions, 0 changer transitions 0/77 dead transitions. [2024-11-10 14:43:43,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 77 transitions, 169 flow [2024-11-10 14:43:43,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:43:43,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:43:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 152 transitions. [2024-11-10 14:43:43,853 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9620253164556962 [2024-11-10 14:43:43,855 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 165 flow. Second operand 2 states and 152 transitions. [2024-11-10 14:43:43,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 77 transitions, 169 flow [2024-11-10 14:43:43,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 77 transitions, 169 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:43,861 INFO L231 Difference]: Finished difference. Result has 80 places, 77 transitions, 161 flow [2024-11-10 14:43:43,864 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=161, PETRI_PLACES=80, PETRI_TRANSITIONS=77} [2024-11-10 14:43:43,866 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 1 predicate places. [2024-11-10 14:43:43,866 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 77 transitions, 161 flow [2024-11-10 14:43:43,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 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:43,867 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:43,867 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] [2024-11-10 14:43:43,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:43:43,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:43:43,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:43,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1458448492, now seen corresponding path program 1 times [2024-11-10 14:43:43,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:43,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064195539] [2024-11-10 14:43:43,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:43,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:43,983 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:43:43,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:43,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064195539] [2024-11-10 14:43:43,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064195539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:43,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:43,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:43:43,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842084426] [2024-11-10 14:43:43,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:43,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:43:43,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:43,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:43:43,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:43:44,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 79 [2024-11-10 14:43:44,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 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:44,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:44,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 79 [2024-11-10 14:43:44,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:44,061 INFO L124 PetriNetUnfolderBase]: 8/182 cut-off events. [2024-11-10 14:43:44,062 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:43:44,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 182 events. 8/182 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 549 event pairs, 2 based on Foata normal form. 1/164 useless extension candidates. Maximal degree in co-relation 213. Up to 17 conditions per place. [2024-11-10 14:43:44,065 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 10 selfloop transitions, 4 changer transitions 1/81 dead transitions. [2024-11-10 14:43:44,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 81 transitions, 199 flow [2024-11-10 14:43:44,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:43:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 14:43:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2024-11-10 14:43:44,067 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8860759493670886 [2024-11-10 14:43:44,068 INFO L175 Difference]: Start difference. First operand has 80 places, 77 transitions, 161 flow. Second operand 4 states and 280 transitions. [2024-11-10 14:43:44,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 81 transitions, 199 flow [2024-11-10 14:43:44,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 81 transitions, 199 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:44,071 INFO L231 Difference]: Finished difference. Result has 84 places, 77 transitions, 173 flow [2024-11-10 14:43:44,072 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=84, PETRI_TRANSITIONS=77} [2024-11-10 14:43:44,072 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 5 predicate places. [2024-11-10 14:43:44,072 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 77 transitions, 173 flow [2024-11-10 14:43:44,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.25) internal successors, (269), 4 states have internal predecessors, (269), 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:44,073 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:44,073 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] [2024-11-10 14:43:44,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:43:44,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:43:44,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:44,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1549016186, now seen corresponding path program 1 times [2024-11-10 14:43:44,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:44,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173454432] [2024-11-10 14:43:44,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:44,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:44,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:44,389 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:43:44,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:44,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173454432] [2024-11-10 14:43:44,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173454432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:44,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:44,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:43:44,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664391842] [2024-11-10 14:43:44,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:44,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:43:44,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:44,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:43:44,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:43:44,500 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 79 [2024-11-10 14:43:44,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 77 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 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:44,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:44,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 79 [2024-11-10 14:43:44,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:44,559 INFO L124 PetriNetUnfolderBase]: 30/218 cut-off events. [2024-11-10 14:43:44,560 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-10 14:43:44,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 218 events. 30/218 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 889 event pairs, 11 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 330. Up to 62 conditions per place. [2024-11-10 14:43:44,561 INFO L140 encePairwiseOnDemand]: 73/79 looper letters, 25 selfloop transitions, 5 changer transitions 0/84 dead transitions. [2024-11-10 14:43:44,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 84 transitions, 247 flow [2024-11-10 14:43:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:43:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:43:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 355 transitions. [2024-11-10 14:43:44,565 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7489451476793249 [2024-11-10 14:43:44,565 INFO L175 Difference]: Start difference. First operand has 84 places, 77 transitions, 173 flow. Second operand 6 states and 355 transitions. [2024-11-10 14:43:44,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 84 transitions, 247 flow [2024-11-10 14:43:44,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 84 transitions, 239 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 14:43:44,569 INFO L231 Difference]: Finished difference. Result has 85 places, 76 transitions, 173 flow [2024-11-10 14:43:44,569 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=85, PETRI_TRANSITIONS=76} [2024-11-10 14:43:44,569 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 6 predicate places. [2024-11-10 14:43:44,570 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 76 transitions, 173 flow [2024-11-10 14:43:44,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 55.5) internal successors, (333), 6 states have internal predecessors, (333), 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:44,570 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:44,570 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] [2024-11-10 14:43:44,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:43:44,570 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:43:44,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:44,571 INFO L85 PathProgramCache]: Analyzing trace with hash -134464211, now seen corresponding path program 1 times [2024-11-10 14:43:44,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:44,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019287950] [2024-11-10 14:43:44,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:44,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:44,612 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:43:44,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:44,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019287950] [2024-11-10 14:43:44,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019287950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:44,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:44,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:44,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177379348] [2024-11-10 14:43:44,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:44,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:44,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:44,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:44,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:44,628 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 79 [2024-11-10 14:43:44,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 76 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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:44,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:44,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 79 [2024-11-10 14:43:44,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:44,647 INFO L124 PetriNetUnfolderBase]: 6/145 cut-off events. [2024-11-10 14:43:44,647 INFO L125 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2024-11-10 14:43:44,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 145 events. 6/145 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 376 event pairs, 4 based on Foata normal form. 1/132 useless extension candidates. Maximal degree in co-relation 184. Up to 21 conditions per place. [2024-11-10 14:43:44,649 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 9 selfloop transitions, 4 changer transitions 0/79 dead transitions. [2024-11-10 14:43:44,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 79 transitions, 205 flow [2024-11-10 14:43:44,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:44,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 215 transitions. [2024-11-10 14:43:44,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9071729957805907 [2024-11-10 14:43:44,651 INFO L175 Difference]: Start difference. First operand has 85 places, 76 transitions, 173 flow. Second operand 3 states and 215 transitions. [2024-11-10 14:43:44,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 79 transitions, 205 flow [2024-11-10 14:43:44,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 79 transitions, 195 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:43:44,652 INFO L231 Difference]: Finished difference. Result has 84 places, 79 transitions, 193 flow [2024-11-10 14:43:44,653 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=193, PETRI_PLACES=84, PETRI_TRANSITIONS=79} [2024-11-10 14:43:44,653 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 5 predicate places. [2024-11-10 14:43:44,653 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 79 transitions, 193 flow [2024-11-10 14:43:44,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 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:44,654 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:44,654 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] [2024-11-10 14:43:44,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:43:44,654 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:43:44,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:44,654 INFO L85 PathProgramCache]: Analyzing trace with hash 60735091, now seen corresponding path program 1 times [2024-11-10 14:43:44,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:44,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377998124] [2024-11-10 14:43:44,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:44,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:44,724 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:43:44,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:44,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377998124] [2024-11-10 14:43:44,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377998124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:44,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:44,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:43:44,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165322448] [2024-11-10 14:43:44,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:44,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:43:44,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:44,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:43:44,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:43:44,763 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 79 [2024-11-10 14:43:44,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 79 transitions, 193 flow. Second operand has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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:44,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:44,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 79 [2024-11-10 14:43:44,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:44,782 INFO L124 PetriNetUnfolderBase]: 2/117 cut-off events. [2024-11-10 14:43:44,782 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:43:44,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 117 events. 2/117 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 163 event pairs, 0 based on Foata normal form. 3/114 useless extension candidates. Maximal degree in co-relation 143. Up to 7 conditions per place. [2024-11-10 14:43:44,783 INFO L140 encePairwiseOnDemand]: 74/79 looper letters, 9 selfloop transitions, 3 changer transitions 7/77 dead transitions. [2024-11-10 14:43:44,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 77 transitions, 203 flow [2024-11-10 14:43:44,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:43:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 14:43:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 278 transitions. [2024-11-10 14:43:44,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.879746835443038 [2024-11-10 14:43:44,784 INFO L175 Difference]: Start difference. First operand has 84 places, 79 transitions, 193 flow. Second operand 4 states and 278 transitions. [2024-11-10 14:43:44,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 77 transitions, 203 flow [2024-11-10 14:43:44,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 77 transitions, 191 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-10 14:43:44,785 INFO L231 Difference]: Finished difference. Result has 83 places, 68 transitions, 157 flow [2024-11-10 14:43:44,786 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=79, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=83, PETRI_TRANSITIONS=68} [2024-11-10 14:43:44,786 INFO L277 CegarLoopForPetriNet]: 79 programPoint places, 4 predicate places. [2024-11-10 14:43:44,787 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 68 transitions, 157 flow [2024-11-10 14:43:44,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.5) internal successors, (270), 4 states have internal predecessors, (270), 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:44,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:44,788 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:44,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:43:44,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2024-11-10 14:43:44,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:44,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1202867191, now seen corresponding path program 1 times [2024-11-10 14:43:44,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:44,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872381944] [2024-11-10 14:43:44,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:44,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:44,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:43:44,809 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:43:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:43:44,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:43:44,841 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:43:44,842 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-11-10 14:43:44,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2024-11-10 14:43:44,844 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2024-11-10 14:43:44,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2024-11-10 14:43:44,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2024-11-10 14:43:44,845 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2024-11-10 14:43:44,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:43:44,845 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 14:43:44,847 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:43:44,847 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:43:44,875 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:43:44,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 97 transitions, 210 flow [2024-11-10 14:43:44,897 INFO L124 PetriNetUnfolderBase]: 10/204 cut-off events. [2024-11-10 14:43:44,898 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:43:44,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 204 events. 10/204 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 467 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 118. Up to 8 conditions per place. [2024-11-10 14:43:44,900 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 97 transitions, 210 flow [2024-11-10 14:43:44,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 97 transitions, 210 flow [2024-11-10 14:43:44,901 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:43:44,902 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;@60123bb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:43:44,902 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 14:43:44,905 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:43:44,906 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-10 14:43:44,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:43:44,906 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:44,906 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] [2024-11-10 14:43:44,906 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-10 14:43:44,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:44,906 INFO L85 PathProgramCache]: Analyzing trace with hash 492748566, now seen corresponding path program 1 times [2024-11-10 14:43:44,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:44,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937397646] [2024-11-10 14:43:44,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:44,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:44,918 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:43:44,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:44,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937397646] [2024-11-10 14:43:44,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937397646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:44,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:44,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:44,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360837555] [2024-11-10 14:43:44,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:44,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:43:44,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:44,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:43:44,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:43:44,919 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 97 [2024-11-10 14:43:44,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 97 transitions, 210 flow. Second operand has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 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:44,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:44,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 97 [2024-11-10 14:43:44,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:44,952 INFO L124 PetriNetUnfolderBase]: 13/313 cut-off events. [2024-11-10 14:43:44,952 INFO L125 PetriNetUnfolderBase]: For 35/57 co-relation queries the response was YES. [2024-11-10 14:43:44,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 313 events. 13/313 cut-off events. For 35/57 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1080 event pairs, 10 based on Foata normal form. 21/299 useless extension candidates. Maximal degree in co-relation 198. Up to 31 conditions per place. [2024-11-10 14:43:44,954 INFO L140 encePairwiseOnDemand]: 95/97 looper letters, 8 selfloop transitions, 0 changer transitions 0/95 dead transitions. [2024-11-10 14:43:44,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 95 transitions, 222 flow [2024-11-10 14:43:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:43:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:43:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2024-11-10 14:43:44,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9484536082474226 [2024-11-10 14:43:44,955 INFO L175 Difference]: Start difference. First operand has 98 places, 97 transitions, 210 flow. Second operand 2 states and 184 transitions. [2024-11-10 14:43:44,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 95 transitions, 222 flow [2024-11-10 14:43:44,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 95 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:44,957 INFO L231 Difference]: Finished difference. Result has 99 places, 95 transitions, 206 flow [2024-11-10 14:43:44,957 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=206, PETRI_PLACES=99, PETRI_TRANSITIONS=95} [2024-11-10 14:43:44,957 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 1 predicate places. [2024-11-10 14:43:44,957 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 95 transitions, 206 flow [2024-11-10 14:43:44,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.0) internal successors, (176), 2 states have internal predecessors, (176), 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:44,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:44,958 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] [2024-11-10 14:43:44,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:43:44,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-10 14:43:44,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:44,960 INFO L85 PathProgramCache]: Analyzing trace with hash 182430188, now seen corresponding path program 1 times [2024-11-10 14:43:44,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:44,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284839804] [2024-11-10 14:43:44,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:44,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:44,990 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:43:44,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:44,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284839804] [2024-11-10 14:43:44,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284839804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:44,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:44,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:43:44,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371577212] [2024-11-10 14:43:44,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:44,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:43:44,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:44,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:43:44,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:43:45,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 97 [2024-11-10 14:43:45,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 95 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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:45,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:45,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 97 [2024-11-10 14:43:45,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:45,088 INFO L124 PetriNetUnfolderBase]: 72/626 cut-off events. [2024-11-10 14:43:45,089 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-11-10 14:43:45,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 793 conditions, 626 events. 72/626 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3775 event pairs, 20 based on Foata normal form. 1/571 useless extension candidates. Maximal degree in co-relation 788. Up to 106 conditions per place. [2024-11-10 14:43:45,092 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 18 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2024-11-10 14:43:45,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 102 transitions, 264 flow [2024-11-10 14:43:45,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:43:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 14:43:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2024-11-10 14:43:45,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.884020618556701 [2024-11-10 14:43:45,093 INFO L175 Difference]: Start difference. First operand has 99 places, 95 transitions, 206 flow. Second operand 4 states and 343 transitions. [2024-11-10 14:43:45,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 102 transitions, 264 flow [2024-11-10 14:43:45,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 102 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:45,095 INFO L231 Difference]: Finished difference. Result has 103 places, 96 transitions, 222 flow [2024-11-10 14:43:45,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=103, PETRI_TRANSITIONS=96} [2024-11-10 14:43:45,096 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 5 predicate places. [2024-11-10 14:43:45,096 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 96 transitions, 222 flow [2024-11-10 14:43:45,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 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:45,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:45,097 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] [2024-11-10 14:43:45,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:43:45,097 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-10 14:43:45,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:45,097 INFO L85 PathProgramCache]: Analyzing trace with hash -638891494, now seen corresponding path program 1 times [2024-11-10 14:43:45,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:45,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347289766] [2024-11-10 14:43:45,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:45,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:45,279 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:43:45,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:45,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347289766] [2024-11-10 14:43:45,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347289766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:45,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:45,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:43:45,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224546540] [2024-11-10 14:43:45,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:45,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:43:45,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:45,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:43:45,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:43:45,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 97 [2024-11-10 14:43:45,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 96 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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:45,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:45,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 97 [2024-11-10 14:43:45,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:45,486 INFO L124 PetriNetUnfolderBase]: 236/981 cut-off events. [2024-11-10 14:43:45,486 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-10 14:43:45,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 981 events. 236/981 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6966 event pairs, 34 based on Foata normal form. 0/915 useless extension candidates. Maximal degree in co-relation 1510. Up to 313 conditions per place. [2024-11-10 14:43:45,492 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 38 selfloop transitions, 5 changer transitions 0/111 dead transitions. [2024-11-10 14:43:45,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 111 transitions, 338 flow [2024-11-10 14:43:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:43:45,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:43:45,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 451 transitions. [2024-11-10 14:43:45,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7749140893470791 [2024-11-10 14:43:45,494 INFO L175 Difference]: Start difference. First operand has 103 places, 96 transitions, 222 flow. Second operand 6 states and 451 transitions. [2024-11-10 14:43:45,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 111 transitions, 338 flow [2024-11-10 14:43:45,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 111 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:43:45,496 INFO L231 Difference]: Finished difference. Result has 105 places, 95 transitions, 224 flow [2024-11-10 14:43:45,496 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=105, PETRI_TRANSITIONS=95} [2024-11-10 14:43:45,496 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 7 predicate places. [2024-11-10 14:43:45,497 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 95 transitions, 224 flow [2024-11-10 14:43:45,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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:45,497 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:45,497 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] [2024-11-10 14:43:45,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:43:45,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-10 14:43:45,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash -64954019, now seen corresponding path program 1 times [2024-11-10 14:43:45,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:45,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181630562] [2024-11-10 14:43:45,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:45,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:45,519 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:43:45,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:45,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181630562] [2024-11-10 14:43:45,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181630562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:45,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:45,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:45,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766028619] [2024-11-10 14:43:45,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:45,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:45,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:45,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:45,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:45,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 97 [2024-11-10 14:43:45,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 95 transitions, 224 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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:45,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:45,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 97 [2024-11-10 14:43:45,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:45,594 INFO L124 PetriNetUnfolderBase]: 116/720 cut-off events. [2024-11-10 14:43:45,594 INFO L125 PetriNetUnfolderBase]: For 95/159 co-relation queries the response was YES. [2024-11-10 14:43:45,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 720 events. 116/720 cut-off events. For 95/159 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4591 event pairs, 58 based on Foata normal form. 4/627 useless extension candidates. Maximal degree in co-relation 1012. Up to 185 conditions per place. [2024-11-10 14:43:45,599 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 18 selfloop transitions, 5 changer transitions 0/103 dead transitions. [2024-11-10 14:43:45,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 103 transitions, 294 flow [2024-11-10 14:43:45,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:45,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:45,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2024-11-10 14:43:45,600 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9072164948453608 [2024-11-10 14:43:45,600 INFO L175 Difference]: Start difference. First operand has 105 places, 95 transitions, 224 flow. Second operand 3 states and 264 transitions. [2024-11-10 14:43:45,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 103 transitions, 294 flow [2024-11-10 14:43:45,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 103 transitions, 284 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:43:45,612 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 252 flow [2024-11-10 14:43:45,613 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2024-11-10 14:43:45,613 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2024-11-10 14:43:45,613 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 252 flow [2024-11-10 14:43:45,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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:45,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:45,614 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] [2024-11-10 14:43:45,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:43:45,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-10 14:43:45,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:45,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1894648579, now seen corresponding path program 1 times [2024-11-10 14:43:45,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:45,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151949573] [2024-11-10 14:43:45,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:45,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:45,658 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:43:45,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:45,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151949573] [2024-11-10 14:43:45,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151949573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:45,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:45,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:43:45,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450150240] [2024-11-10 14:43:45,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:45,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:43:45,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:45,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:43:45,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:43:45,683 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 97 [2024-11-10 14:43:45,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 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:45,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:45,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 97 [2024-11-10 14:43:45,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:45,747 INFO L124 PetriNetUnfolderBase]: 63/607 cut-off events. [2024-11-10 14:43:45,747 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-10 14:43:45,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 607 events. 63/607 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3375 event pairs, 24 based on Foata normal form. 15/571 useless extension candidates. Maximal degree in co-relation 830. Up to 72 conditions per place. [2024-11-10 14:43:45,751 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 19 selfloop transitions, 4 changer transitions 3/110 dead transitions. [2024-11-10 14:43:45,751 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 110 transitions, 332 flow [2024-11-10 14:43:45,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:43:45,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 14:43:45,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2024-11-10 14:43:45,752 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8943298969072165 [2024-11-10 14:43:45,752 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 252 flow. Second operand 4 states and 347 transitions. [2024-11-10 14:43:45,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 110 transitions, 332 flow [2024-11-10 14:43:45,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 110 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:43:45,754 INFO L231 Difference]: Finished difference. Result has 106 places, 100 transitions, 258 flow [2024-11-10 14:43:45,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=106, PETRI_TRANSITIONS=100} [2024-11-10 14:43:45,755 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, 8 predicate places. [2024-11-10 14:43:45,756 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 100 transitions, 258 flow [2024-11-10 14:43:45,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 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:45,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:45,756 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] [2024-11-10 14:43:45,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:43:45,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-10 14:43:45,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:45,757 INFO L85 PathProgramCache]: Analyzing trace with hash -249923928, now seen corresponding path program 1 times [2024-11-10 14:43:45,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:45,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563233619] [2024-11-10 14:43:45,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:45,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:45,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:45,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563233619] [2024-11-10 14:43:45,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563233619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:43:45,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669809188] [2024-11-10 14:43:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:45,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:43:45,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:43:45,829 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:43:45,830 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:43:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:45,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 14:43:45,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:45,996 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:43:46,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:46,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669809188] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:43:46,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:43:46,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-10 14:43:46,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674635265] [2024-11-10 14:43:46,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:43:46,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 14:43:46,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:46,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 14:43:46,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-10 14:43:46,166 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 97 [2024-11-10 14:43:46,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 100 transitions, 258 flow. Second operand has 13 states, 13 states have (on average 78.92307692307692) internal successors, (1026), 13 states have internal predecessors, (1026), 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:46,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:46,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 97 [2024-11-10 14:43:46,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:46,272 INFO L124 PetriNetUnfolderBase]: 81/467 cut-off events. [2024-11-10 14:43:46,273 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-11-10 14:43:46,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 467 events. 81/467 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2474 event pairs, 1 based on Foata normal form. 15/460 useless extension candidates. Maximal degree in co-relation 666. Up to 56 conditions per place. [2024-11-10 14:43:46,274 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 28 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2024-11-10 14:43:46,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 93 transitions, 292 flow [2024-11-10 14:43:46,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 14:43:46,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 14:43:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 808 transitions. [2024-11-10 14:43:46,276 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8329896907216495 [2024-11-10 14:43:46,276 INFO L175 Difference]: Start difference. First operand has 106 places, 100 transitions, 258 flow. Second operand 10 states and 808 transitions. [2024-11-10 14:43:46,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 93 transitions, 292 flow [2024-11-10 14:43:46,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 93 transitions, 291 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:43:46,277 INFO L231 Difference]: Finished difference. Result has 88 places, 73 transitions, 195 flow [2024-11-10 14:43:46,278 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=195, PETRI_PLACES=88, PETRI_TRANSITIONS=73} [2024-11-10 14:43:46,278 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -10 predicate places. [2024-11-10 14:43:46,278 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 73 transitions, 195 flow [2024-11-10 14:43:46,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 78.92307692307692) internal successors, (1026), 13 states have internal predecessors, (1026), 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:46,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:46,279 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:46,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 14:43:46,479 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,SelfDestructingSolverStorable11 [2024-11-10 14:43:46,480 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-10 14:43:46,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:46,480 INFO L85 PathProgramCache]: Analyzing trace with hash -240598749, now seen corresponding path program 1 times [2024-11-10 14:43:46,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:46,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984689211] [2024-11-10 14:43:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:46,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:43:46,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:46,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984689211] [2024-11-10 14:43:46,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984689211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:46,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:46,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:46,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66974734] [2024-11-10 14:43:46,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:46,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:46,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:46,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:46,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:46,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 97 [2024-11-10 14:43:46,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 73 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:46,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:46,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 97 [2024-11-10 14:43:46,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:46,568 INFO L124 PetriNetUnfolderBase]: 27/232 cut-off events. [2024-11-10 14:43:46,569 INFO L125 PetriNetUnfolderBase]: For 27/31 co-relation queries the response was YES. [2024-11-10 14:43:46,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 232 events. 27/232 cut-off events. For 27/31 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 829 event pairs, 16 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 363. Up to 55 conditions per place. [2024-11-10 14:43:46,570 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 13 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2024-11-10 14:43:46,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 78 transitions, 243 flow [2024-11-10 14:43:46,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:46,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 258 transitions. [2024-11-10 14:43:46,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8865979381443299 [2024-11-10 14:43:46,571 INFO L175 Difference]: Start difference. First operand has 88 places, 73 transitions, 195 flow. Second operand 3 states and 258 transitions. [2024-11-10 14:43:46,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 78 transitions, 243 flow [2024-11-10 14:43:46,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 78 transitions, 226 flow, removed 1 selfloop flow, removed 6 redundant places. [2024-11-10 14:43:46,573 INFO L231 Difference]: Finished difference. Result has 86 places, 76 transitions, 214 flow [2024-11-10 14:43:46,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=86, PETRI_TRANSITIONS=76} [2024-11-10 14:43:46,574 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -12 predicate places. [2024-11-10 14:43:46,574 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 76 transitions, 214 flow [2024-11-10 14:43:46,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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:46,575 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:46,575 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:46,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:43:46,575 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-10 14:43:46,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:46,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1033364713, now seen corresponding path program 1 times [2024-11-10 14:43:46,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:46,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770156422] [2024-11-10 14:43:46,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:46,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:46,636 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:43:46,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:46,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770156422] [2024-11-10 14:43:46,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770156422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:46,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:46,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:43:46,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174398155] [2024-11-10 14:43:46,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:46,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:46,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:46,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:46,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:46,650 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 97 [2024-11-10 14:43:46,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 76 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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:46,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:46,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 97 [2024-11-10 14:43:46,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:46,667 INFO L124 PetriNetUnfolderBase]: 3/144 cut-off events. [2024-11-10 14:43:46,667 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-10 14:43:46,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 144 events. 3/144 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 273 event pairs, 0 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 195. Up to 10 conditions per place. [2024-11-10 14:43:46,668 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 4 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2024-11-10 14:43:46,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 69 transitions, 195 flow [2024-11-10 14:43:46,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2024-11-10 14:43:46,669 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9209621993127147 [2024-11-10 14:43:46,669 INFO L175 Difference]: Start difference. First operand has 86 places, 76 transitions, 214 flow. Second operand 3 states and 268 transitions. [2024-11-10 14:43:46,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 69 transitions, 195 flow [2024-11-10 14:43:46,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 69 transitions, 175 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-11-10 14:43:46,670 INFO L231 Difference]: Finished difference. Result has 80 places, 68 transitions, 160 flow [2024-11-10 14:43:46,670 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=80, PETRI_TRANSITIONS=68} [2024-11-10 14:43:46,671 INFO L277 CegarLoopForPetriNet]: 98 programPoint places, -18 predicate places. [2024-11-10 14:43:46,671 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 68 transitions, 160 flow [2024-11-10 14:43:46,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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:46,671 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:46,671 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:46,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:43:46,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2024-11-10 14:43:46,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:46,672 INFO L85 PathProgramCache]: Analyzing trace with hash -454503742, now seen corresponding path program 1 times [2024-11-10 14:43:46,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:46,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275172655] [2024-11-10 14:43:46,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:46,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:43:46,684 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:43:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:43:46,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:43:46,696 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:43:46,696 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-10 14:43:46,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2024-11-10 14:43:46,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2024-11-10 14:43:46,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2024-11-10 14:43:46,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2024-11-10 14:43:46,696 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2024-11-10 14:43:46,697 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2024-11-10 14:43:46,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:43:46,697 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:46,697 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:43:46,697 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 14:43:46,713 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:43:46,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 115 transitions, 257 flow [2024-11-10 14:43:46,737 INFO L124 PetriNetUnfolderBase]: 20/343 cut-off events. [2024-11-10 14:43:46,737 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-10 14:43:46,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 343 events. 20/343 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 969 event pairs, 1 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 212. Up to 16 conditions per place. [2024-11-10 14:43:46,737 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 115 transitions, 257 flow [2024-11-10 14:43:46,739 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 115 transitions, 257 flow [2024-11-10 14:43:46,741 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:43:46,741 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;@60123bb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:43:46,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-10 14:43:46,742 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:43:46,742 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-10 14:43:46,742 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:43:46,742 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:46,742 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] [2024-11-10 14:43:46,743 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-10 14:43:46,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:46,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1685206326, now seen corresponding path program 1 times [2024-11-10 14:43:46,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:46,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453519908] [2024-11-10 14:43:46,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:46,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:46,755 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:43:46,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:46,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453519908] [2024-11-10 14:43:46,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453519908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:46,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:46,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:46,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917651636] [2024-11-10 14:43:46,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:46,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:43:46,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:46,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:43:46,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:43:46,757 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 115 [2024-11-10 14:43:46,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 115 transitions, 257 flow. Second operand has 2 states, 2 states have (on average 102.0) internal successors, (204), 2 states have internal predecessors, (204), 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:46,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:46,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 115 [2024-11-10 14:43:46,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:46,858 INFO L124 PetriNetUnfolderBase]: 98/1088 cut-off events. [2024-11-10 14:43:46,858 INFO L125 PetriNetUnfolderBase]: For 235/366 co-relation queries the response was YES. [2024-11-10 14:43:46,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 1088 events. 98/1088 cut-off events. For 235/366 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7075 event pairs, 87 based on Foata normal form. 80/1039 useless extension candidates. Maximal degree in co-relation 814. Up to 172 conditions per place. [2024-11-10 14:43:46,863 INFO L140 encePairwiseOnDemand]: 113/115 looper letters, 12 selfloop transitions, 0 changer transitions 0/113 dead transitions. [2024-11-10 14:43:46,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 113 transitions, 277 flow [2024-11-10 14:43:46,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:43:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:43:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 216 transitions. [2024-11-10 14:43:46,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9391304347826087 [2024-11-10 14:43:46,864 INFO L175 Difference]: Start difference. First operand has 117 places, 115 transitions, 257 flow. Second operand 2 states and 216 transitions. [2024-11-10 14:43:46,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 113 transitions, 277 flow [2024-11-10 14:43:46,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 113 transitions, 277 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:46,865 INFO L231 Difference]: Finished difference. Result has 118 places, 113 transitions, 253 flow [2024-11-10 14:43:46,866 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=253, PETRI_PLACES=118, PETRI_TRANSITIONS=113} [2024-11-10 14:43:46,867 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2024-11-10 14:43:46,867 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 113 transitions, 253 flow [2024-11-10 14:43:46,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 102.0) internal successors, (204), 2 states have internal predecessors, (204), 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:46,867 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:46,867 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] [2024-11-10 14:43:46,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:43:46,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-10 14:43:46,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:46,868 INFO L85 PathProgramCache]: Analyzing trace with hash -621926804, now seen corresponding path program 1 times [2024-11-10 14:43:46,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:46,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777956866] [2024-11-10 14:43:46,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:46,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:46,898 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:43:46,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:46,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777956866] [2024-11-10 14:43:46,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777956866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:46,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:46,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:43:46,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445914818] [2024-11-10 14:43:46,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:46,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:43:46,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:46,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:43:46,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:43:46,927 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 115 [2024-11-10 14:43:46,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 113 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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:46,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:46,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 115 [2024-11-10 14:43:46,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:47,095 INFO L124 PetriNetUnfolderBase]: 413/2207 cut-off events. [2024-11-10 14:43:47,095 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2024-11-10 14:43:47,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2982 conditions, 2207 events. 413/2207 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 17551 event pairs, 232 based on Foata normal form. 1/2019 useless extension candidates. Maximal degree in co-relation 2976. Up to 496 conditions per place. [2024-11-10 14:43:47,107 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 24 selfloop transitions, 4 changer transitions 0/122 dead transitions. [2024-11-10 14:43:47,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 122 transitions, 327 flow [2024-11-10 14:43:47,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:43:47,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 14:43:47,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 405 transitions. [2024-11-10 14:43:47,108 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8804347826086957 [2024-11-10 14:43:47,109 INFO L175 Difference]: Start difference. First operand has 118 places, 113 transitions, 253 flow. Second operand 4 states and 405 transitions. [2024-11-10 14:43:47,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 122 transitions, 327 flow [2024-11-10 14:43:47,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 122 transitions, 327 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:47,110 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 269 flow [2024-11-10 14:43:47,111 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=269, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2024-11-10 14:43:47,111 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 5 predicate places. [2024-11-10 14:43:47,112 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 269 flow [2024-11-10 14:43:47,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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:47,112 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:47,112 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] [2024-11-10 14:43:47,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:43:47,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-10 14:43:47,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:47,112 INFO L85 PathProgramCache]: Analyzing trace with hash -531843846, now seen corresponding path program 1 times [2024-11-10 14:43:47,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:47,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605271586] [2024-11-10 14:43:47,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:47,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:47,250 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:43:47,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:47,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605271586] [2024-11-10 14:43:47,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605271586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:47,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:47,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:43:47,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705819486] [2024-11-10 14:43:47,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:47,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:43:47,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:47,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:43:47,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:43:47,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 115 [2024-11-10 14:43:47,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 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:47,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:47,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 115 [2024-11-10 14:43:47,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:47,658 INFO L124 PetriNetUnfolderBase]: 1295/4022 cut-off events. [2024-11-10 14:43:47,658 INFO L125 PetriNetUnfolderBase]: For 327/327 co-relation queries the response was YES. [2024-11-10 14:43:47,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6375 conditions, 4022 events. 1295/4022 cut-off events. For 327/327 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 35602 event pairs, 181 based on Foata normal form. 0/3745 useless extension candidates. Maximal degree in co-relation 6367. Up to 1483 conditions per place. [2024-11-10 14:43:47,678 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 50 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2024-11-10 14:43:47,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 137 transitions, 425 flow [2024-11-10 14:43:47,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:43:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:43:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 547 transitions. [2024-11-10 14:43:47,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7927536231884058 [2024-11-10 14:43:47,680 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 269 flow. Second operand 6 states and 547 transitions. [2024-11-10 14:43:47,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 137 transitions, 425 flow [2024-11-10 14:43:47,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 137 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:43:47,683 INFO L231 Difference]: Finished difference. Result has 124 places, 113 transitions, 271 flow [2024-11-10 14:43:47,683 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=124, PETRI_TRANSITIONS=113} [2024-11-10 14:43:47,683 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 7 predicate places. [2024-11-10 14:43:47,683 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 113 transitions, 271 flow [2024-11-10 14:43:47,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 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:47,684 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:47,684 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] [2024-11-10 14:43:47,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:43:47,684 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-10 14:43:47,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1710788141, now seen corresponding path program 1 times [2024-11-10 14:43:47,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:47,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928185911] [2024-11-10 14:43:47,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:47,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:47,701 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:43:47,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:47,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928185911] [2024-11-10 14:43:47,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928185911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:47,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:47,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:47,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568936957] [2024-11-10 14:43:47,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:47,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:47,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:47,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:47,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:47,716 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 115 [2024-11-10 14:43:47,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 113 transitions, 271 flow. Second operand has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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:47,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:47,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 115 [2024-11-10 14:43:47,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:48,073 INFO L124 PetriNetUnfolderBase]: 1023/4148 cut-off events. [2024-11-10 14:43:48,074 INFO L125 PetriNetUnfolderBase]: For 867/1327 co-relation queries the response was YES. [2024-11-10 14:43:48,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6121 conditions, 4148 events. 1023/4148 cut-off events. For 867/1327 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 39807 event pairs, 572 based on Foata normal form. 9/3607 useless extension candidates. Maximal degree in co-relation 6113. Up to 1329 conditions per place. [2024-11-10 14:43:48,095 INFO L140 encePairwiseOnDemand]: 108/115 looper letters, 27 selfloop transitions, 6 changer transitions 0/126 dead transitions. [2024-11-10 14:43:48,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 126 transitions, 381 flow [2024-11-10 14:43:48,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:48,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2024-11-10 14:43:48,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9072463768115943 [2024-11-10 14:43:48,096 INFO L175 Difference]: Start difference. First operand has 124 places, 113 transitions, 271 flow. Second operand 3 states and 313 transitions. [2024-11-10 14:43:48,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 126 transitions, 381 flow [2024-11-10 14:43:48,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 126 transitions, 371 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:43:48,098 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 307 flow [2024-11-10 14:43:48,098 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=123, PETRI_TRANSITIONS=118} [2024-11-10 14:43:48,098 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 6 predicate places. [2024-11-10 14:43:48,099 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 307 flow [2024-11-10 14:43:48,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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:48,099 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:48,099 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] [2024-11-10 14:43:48,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:43:48,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-10 14:43:48,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:48,100 INFO L85 PathProgramCache]: Analyzing trace with hash -835623213, now seen corresponding path program 1 times [2024-11-10 14:43:48,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:48,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980033880] [2024-11-10 14:43:48,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:48,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:48,139 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:43:48,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:48,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980033880] [2024-11-10 14:43:48,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980033880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:48,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:48,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:43:48,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177936388] [2024-11-10 14:43:48,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:48,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:43:48,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:48,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:43:48,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:43:48,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 115 [2024-11-10 14:43:48,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 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:48,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:48,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 115 [2024-11-10 14:43:48,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:48,436 INFO L124 PetriNetUnfolderBase]: 666/3354 cut-off events. [2024-11-10 14:43:48,436 INFO L125 PetriNetUnfolderBase]: For 434/438 co-relation queries the response was YES. [2024-11-10 14:43:48,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4916 conditions, 3354 events. 666/3354 cut-off events. For 434/438 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 30914 event pairs, 320 based on Foata normal form. 63/3060 useless extension candidates. Maximal degree in co-relation 4907. Up to 536 conditions per place. [2024-11-10 14:43:48,448 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 31 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2024-11-10 14:43:48,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 134 transitions, 418 flow [2024-11-10 14:43:48,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:43:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 14:43:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 412 transitions. [2024-11-10 14:43:48,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8956521739130435 [2024-11-10 14:43:48,450 INFO L175 Difference]: Start difference. First operand has 123 places, 118 transitions, 307 flow. Second operand 4 states and 412 transitions. [2024-11-10 14:43:48,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 134 transitions, 418 flow [2024-11-10 14:43:48,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 134 transitions, 406 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:43:48,452 INFO L231 Difference]: Finished difference. Result has 125 places, 119 transitions, 311 flow [2024-11-10 14:43:48,453 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=311, PETRI_PLACES=125, PETRI_TRANSITIONS=119} [2024-11-10 14:43:48,453 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 8 predicate places. [2024-11-10 14:43:48,453 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 119 transitions, 311 flow [2024-11-10 14:43:48,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 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:48,453 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:48,453 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] [2024-11-10 14:43:48,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 14:43:48,454 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-10 14:43:48,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:48,454 INFO L85 PathProgramCache]: Analyzing trace with hash 313886443, now seen corresponding path program 1 times [2024-11-10 14:43:48,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:48,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690207060] [2024-11-10 14:43:48,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:48,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:48,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:48,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690207060] [2024-11-10 14:43:48,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690207060] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:43:48,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432342671] [2024-11-10 14:43:48,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:48,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:43:48,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:43:48,514 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:43:48,515 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:43:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:48,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 14:43:48,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:48,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:43:48,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:48,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432342671] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:43:48,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:43:48,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-10 14:43:48,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231382296] [2024-11-10 14:43:48,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:43:48,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 14:43:48,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:48,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 14:43:48,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-10 14:43:48,826 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 115 [2024-11-10 14:43:48,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 119 transitions, 311 flow. Second operand has 13 states, 13 states have (on average 92.92307692307692) internal successors, (1208), 13 states have internal predecessors, (1208), 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:48,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:48,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 115 [2024-11-10 14:43:48,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:49,309 INFO L124 PetriNetUnfolderBase]: 1016/4740 cut-off events. [2024-11-10 14:43:49,309 INFO L125 PetriNetUnfolderBase]: For 647/647 co-relation queries the response was YES. [2024-11-10 14:43:49,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7012 conditions, 4740 events. 1016/4740 cut-off events. For 647/647 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 45691 event pairs, 151 based on Foata normal form. 15/4199 useless extension candidates. Maximal degree in co-relation 7002. Up to 749 conditions per place. [2024-11-10 14:43:49,330 INFO L140 encePairwiseOnDemand]: 107/115 looper letters, 50 selfloop transitions, 11 changer transitions 0/157 dead transitions. [2024-11-10 14:43:49,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 157 transitions, 511 flow [2024-11-10 14:43:49,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 14:43:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 14:43:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 973 transitions. [2024-11-10 14:43:49,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8460869565217392 [2024-11-10 14:43:49,333 INFO L175 Difference]: Start difference. First operand has 125 places, 119 transitions, 311 flow. Second operand 10 states and 973 transitions. [2024-11-10 14:43:49,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 157 transitions, 511 flow [2024-11-10 14:43:49,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 157 transitions, 505 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:43:49,340 INFO L231 Difference]: Finished difference. Result has 135 places, 125 transitions, 361 flow [2024-11-10 14:43:49,340 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=361, PETRI_PLACES=135, PETRI_TRANSITIONS=125} [2024-11-10 14:43:49,341 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 18 predicate places. [2024-11-10 14:43:49,341 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 125 transitions, 361 flow [2024-11-10 14:43:49,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 92.92307692307692) internal successors, (1208), 13 states have internal predecessors, (1208), 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:49,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:49,342 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:49,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 14:43:49,542 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,SelfDestructingSolverStorable20 [2024-11-10 14:43:49,542 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-10 14:43:49,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:49,543 INFO L85 PathProgramCache]: Analyzing trace with hash 208200995, now seen corresponding path program 1 times [2024-11-10 14:43:49,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:49,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634980047] [2024-11-10 14:43:49,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:49,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:43:49,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:49,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634980047] [2024-11-10 14:43:49,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634980047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:49,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:49,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:49,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380484110] [2024-11-10 14:43:49,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:49,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:49,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:49,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:49,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:49,586 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 115 [2024-11-10 14:43:49,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 125 transitions, 361 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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:49,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:49,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 115 [2024-11-10 14:43:49,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:49,978 INFO L124 PetriNetUnfolderBase]: 902/4284 cut-off events. [2024-11-10 14:43:49,978 INFO L125 PetriNetUnfolderBase]: For 1483/2035 co-relation queries the response was YES. [2024-11-10 14:43:49,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7067 conditions, 4284 events. 902/4284 cut-off events. For 1483/2035 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 41411 event pairs, 487 based on Foata normal form. 17/3833 useless extension candidates. Maximal degree in co-relation 7054. Up to 1159 conditions per place. [2024-11-10 14:43:49,998 INFO L140 encePairwiseOnDemand]: 108/115 looper letters, 28 selfloop transitions, 9 changer transitions 0/139 dead transitions. [2024-11-10 14:43:49,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 139 transitions, 486 flow [2024-11-10 14:43:49,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:49,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2024-11-10 14:43:49,999 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9043478260869565 [2024-11-10 14:43:49,999 INFO L175 Difference]: Start difference. First operand has 135 places, 125 transitions, 361 flow. Second operand 3 states and 312 transitions. [2024-11-10 14:43:49,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 139 transitions, 486 flow [2024-11-10 14:43:50,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 139 transitions, 478 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-10 14:43:50,002 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 429 flow [2024-11-10 14:43:50,002 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2024-11-10 14:43:50,003 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 20 predicate places. [2024-11-10 14:43:50,003 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 429 flow [2024-11-10 14:43:50,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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:50,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:50,003 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:50,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 14:43:50,003 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-10 14:43:50,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:50,004 INFO L85 PathProgramCache]: Analyzing trace with hash -667551561, now seen corresponding path program 1 times [2024-11-10 14:43:50,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:50,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266301008] [2024-11-10 14:43:50,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:50,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:50,049 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:43:50,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:50,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266301008] [2024-11-10 14:43:50,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266301008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:50,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:50,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:43:50,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425279510] [2024-11-10 14:43:50,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:50,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:50,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:50,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:50,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:50,057 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 115 [2024-11-10 14:43:50,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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:50,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:50,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 115 [2024-11-10 14:43:50,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:50,164 INFO L124 PetriNetUnfolderBase]: 98/1362 cut-off events. [2024-11-10 14:43:50,164 INFO L125 PetriNetUnfolderBase]: For 340/384 co-relation queries the response was YES. [2024-11-10 14:43:50,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 1362 events. 98/1362 cut-off events. For 340/384 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10069 event pairs, 26 based on Foata normal form. 20/1271 useless extension candidates. Maximal degree in co-relation 2019. Up to 101 conditions per place. [2024-11-10 14:43:50,170 INFO L140 encePairwiseOnDemand]: 109/115 looper letters, 12 selfloop transitions, 6 changer transitions 0/131 dead transitions. [2024-11-10 14:43:50,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 131 transitions, 450 flow [2024-11-10 14:43:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:50,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2024-11-10 14:43:50,171 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9304347826086956 [2024-11-10 14:43:50,171 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 429 flow. Second operand 3 states and 321 transitions. [2024-11-10 14:43:50,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 131 transitions, 450 flow [2024-11-10 14:43:50,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 131 transitions, 438 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-10 14:43:50,174 INFO L231 Difference]: Finished difference. Result has 137 places, 126 transitions, 383 flow [2024-11-10 14:43:50,174 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=137, PETRI_TRANSITIONS=126} [2024-11-10 14:43:50,174 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 20 predicate places. [2024-11-10 14:43:50,175 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 126 transitions, 383 flow [2024-11-10 14:43:50,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 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:50,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:50,175 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 14:43:50,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 14:43:50,175 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-10 14:43:50,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:50,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2085304248, now seen corresponding path program 1 times [2024-11-10 14:43:50,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:50,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100659407] [2024-11-10 14:43:50,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:50,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-10 14:43:50,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:50,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100659407] [2024-11-10 14:43:50,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100659407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:50,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:50,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:50,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701345501] [2024-11-10 14:43:50,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:50,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:50,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:50,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:50,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:50,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 115 [2024-11-10 14:43:50,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 126 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:50,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:50,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 115 [2024-11-10 14:43:50,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:50,332 INFO L124 PetriNetUnfolderBase]: 177/1419 cut-off events. [2024-11-10 14:43:50,332 INFO L125 PetriNetUnfolderBase]: For 731/779 co-relation queries the response was YES. [2024-11-10 14:43:50,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2481 conditions, 1419 events. 177/1419 cut-off events. For 731/779 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 10953 event pairs, 135 based on Foata normal form. 3/1308 useless extension candidates. Maximal degree in co-relation 2467. Up to 336 conditions per place. [2024-11-10 14:43:50,336 INFO L140 encePairwiseOnDemand]: 110/115 looper letters, 23 selfloop transitions, 4 changer transitions 0/131 dead transitions. [2024-11-10 14:43:50,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 131 transitions, 457 flow [2024-11-10 14:43:50,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:50,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2024-11-10 14:43:50,337 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8840579710144928 [2024-11-10 14:43:50,337 INFO L175 Difference]: Start difference. First operand has 137 places, 126 transitions, 383 flow. Second operand 3 states and 305 transitions. [2024-11-10 14:43:50,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 131 transitions, 457 flow [2024-11-10 14:43:50,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 131 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:43:50,340 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 411 flow [2024-11-10 14:43:50,340 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2024-11-10 14:43:50,340 INFO L277 CegarLoopForPetriNet]: 117 programPoint places, 23 predicate places. [2024-11-10 14:43:50,341 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 411 flow [2024-11-10 14:43:50,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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:50,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:50,341 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:50,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 14:43:50,341 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2024-11-10 14:43:50,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:50,342 INFO L85 PathProgramCache]: Analyzing trace with hash 723358912, now seen corresponding path program 1 times [2024-11-10 14:43:50,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:50,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138761853] [2024-11-10 14:43:50,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:50,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:43:50,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:43:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:43:50,372 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:43:50,372 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:43:50,372 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-11-10 14:43:50,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2024-11-10 14:43:50,372 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2024-11-10 14:43:50,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2024-11-10 14:43:50,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2024-11-10 14:43:50,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2024-11-10 14:43:50,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2024-11-10 14:43:50,373 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2024-11-10 14:43:50,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 14:43:50,373 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:43:50,373 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:43:50,373 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-10 14:43:50,391 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-10 14:43:50,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 133 transitions, 306 flow [2024-11-10 14:43:50,427 INFO L124 PetriNetUnfolderBase]: 42/586 cut-off events. [2024-11-10 14:43:50,427 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-10 14:43:50,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 586 events. 42/586 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2157 event pairs, 6 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 363. Up to 32 conditions per place. [2024-11-10 14:43:50,428 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 133 transitions, 306 flow [2024-11-10 14:43:50,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 133 transitions, 306 flow [2024-11-10 14:43:50,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:43:50,431 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;@60123bb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:43:50,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-10 14:43:50,433 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:43:50,433 INFO L124 PetriNetUnfolderBase]: 2/35 cut-off events. [2024-11-10 14:43:50,433 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:43:50,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:50,433 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] [2024-11-10 14:43:50,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:43:50,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:50,433 INFO L85 PathProgramCache]: Analyzing trace with hash -670444522, now seen corresponding path program 1 times [2024-11-10 14:43:50,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:50,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980083979] [2024-11-10 14:43:50,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:50,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:50,440 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:43:50,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:50,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980083979] [2024-11-10 14:43:50,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980083979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:50,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:50,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:50,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387265278] [2024-11-10 14:43:50,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:50,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:43:50,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:50,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:43:50,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:43:50,442 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 133 [2024-11-10 14:43:50,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 306 flow. Second operand has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 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:50,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:50,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 133 [2024-11-10 14:43:50,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:50,765 INFO L124 PetriNetUnfolderBase]: 585/4224 cut-off events. [2024-11-10 14:43:50,765 INFO L125 PetriNetUnfolderBase]: For 1323/1870 co-relation queries the response was YES. [2024-11-10 14:43:50,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5544 conditions, 4224 events. 585/4224 cut-off events. For 1323/1870 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 40278 event pairs, 536 based on Foata normal form. 321/4051 useless extension candidates. Maximal degree in co-relation 3527. Up to 877 conditions per place. [2024-11-10 14:43:50,784 INFO L140 encePairwiseOnDemand]: 131/133 looper letters, 16 selfloop transitions, 0 changer transitions 0/131 dead transitions. [2024-11-10 14:43:50,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 131 transitions, 334 flow [2024-11-10 14:43:50,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:43:50,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 14:43:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 248 transitions. [2024-11-10 14:43:50,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9323308270676691 [2024-11-10 14:43:50,785 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 306 flow. Second operand 2 states and 248 transitions. [2024-11-10 14:43:50,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 131 transitions, 334 flow [2024-11-10 14:43:50,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 131 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:50,787 INFO L231 Difference]: Finished difference. Result has 137 places, 131 transitions, 302 flow [2024-11-10 14:43:50,787 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=302, PETRI_PLACES=137, PETRI_TRANSITIONS=131} [2024-11-10 14:43:50,787 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 1 predicate places. [2024-11-10 14:43:50,787 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 131 transitions, 302 flow [2024-11-10 14:43:50,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.0) internal successors, (232), 2 states have internal predecessors, (232), 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:50,788 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:50,788 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] [2024-11-10 14:43:50,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 14:43:50,788 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:43:50,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:50,788 INFO L85 PathProgramCache]: Analyzing trace with hash -954622484, now seen corresponding path program 1 times [2024-11-10 14:43:50,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:50,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220070378] [2024-11-10 14:43:50,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:50,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:50,807 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:43:50,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:50,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220070378] [2024-11-10 14:43:50,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220070378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:50,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:50,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:43:50,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390422405] [2024-11-10 14:43:50,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:50,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:43:50,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:50,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:43:50,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:43:50,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 133 [2024-11-10 14:43:50,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 131 transitions, 302 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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:50,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:50,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 133 [2024-11-10 14:43:50,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:51,607 INFO L124 PetriNetUnfolderBase]: 2017/8271 cut-off events. [2024-11-10 14:43:51,607 INFO L125 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2024-11-10 14:43:51,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11673 conditions, 8271 events. 2017/8271 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 84107 event pairs, 1191 based on Foata normal form. 1/7557 useless extension candidates. Maximal degree in co-relation 11666. Up to 2119 conditions per place. [2024-11-10 14:43:51,659 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 30 selfloop transitions, 4 changer transitions 0/142 dead transitions. [2024-11-10 14:43:51,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 142 transitions, 392 flow [2024-11-10 14:43:51,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:43:51,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 14:43:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2024-11-10 14:43:51,661 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8778195488721805 [2024-11-10 14:43:51,661 INFO L175 Difference]: Start difference. First operand has 137 places, 131 transitions, 302 flow. Second operand 4 states and 467 transitions. [2024-11-10 14:43:51,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 142 transitions, 392 flow [2024-11-10 14:43:51,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 142 transitions, 392 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:43:51,664 INFO L231 Difference]: Finished difference. Result has 141 places, 132 transitions, 318 flow [2024-11-10 14:43:51,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=141, PETRI_TRANSITIONS=132} [2024-11-10 14:43:51,664 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 5 predicate places. [2024-11-10 14:43:51,664 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 132 transitions, 318 flow [2024-11-10 14:43:51,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 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:51,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:51,665 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] [2024-11-10 14:43:51,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 14:43:51,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:43:51,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:51,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1870159130, now seen corresponding path program 1 times [2024-11-10 14:43:51,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:51,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845318771] [2024-11-10 14:43:51,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:51,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:51,786 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:43:51,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:51,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845318771] [2024-11-10 14:43:51,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845318771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:51,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:51,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:43:51,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430618603] [2024-11-10 14:43:51,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:51,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:43:51,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:51,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:43:51,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:43:51,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 133 [2024-11-10 14:43:51,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 132 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 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:51,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:51,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 133 [2024-11-10 14:43:51,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:53,170 INFO L124 PetriNetUnfolderBase]: 6236/15890 cut-off events. [2024-11-10 14:43:53,170 INFO L125 PetriNetUnfolderBase]: For 1706/1706 co-relation queries the response was YES. [2024-11-10 14:43:53,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25955 conditions, 15890 events. 6236/15890 cut-off events. For 1706/1706 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 160228 event pairs, 2634 based on Foata normal form. 0/14948 useless extension candidates. Maximal degree in co-relation 25946. Up to 6781 conditions per place. [2024-11-10 14:43:53,240 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 62 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2024-11-10 14:43:53,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 163 transitions, 514 flow [2024-11-10 14:43:53,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:43:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:43:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions. [2024-11-10 14:43:53,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8057644110275689 [2024-11-10 14:43:53,244 INFO L175 Difference]: Start difference. First operand has 141 places, 132 transitions, 318 flow. Second operand 6 states and 643 transitions. [2024-11-10 14:43:53,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 163 transitions, 514 flow [2024-11-10 14:43:53,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 163 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:43:53,251 INFO L231 Difference]: Finished difference. Result has 143 places, 131 transitions, 320 flow [2024-11-10 14:43:53,251 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=320, PETRI_PLACES=143, PETRI_TRANSITIONS=131} [2024-11-10 14:43:53,251 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 7 predicate places. [2024-11-10 14:43:53,251 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 131 transitions, 320 flow [2024-11-10 14:43:53,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 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:53,252 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:53,252 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] [2024-11-10 14:43:53,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 14:43:53,252 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:43:53,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:53,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1421830989, now seen corresponding path program 1 times [2024-11-10 14:43:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:53,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834158880] [2024-11-10 14:43:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:53,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:53,268 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:43:53,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:53,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834158880] [2024-11-10 14:43:53,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834158880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:53,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:53,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:43:53,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035859018] [2024-11-10 14:43:53,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:53,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:43:53,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:53,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:43:53,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:43:53,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2024-11-10 14:43:53,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 131 transitions, 320 flow. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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:53,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:53,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2024-11-10 14:43:53,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:55,495 INFO L124 PetriNetUnfolderBase]: 7241/23308 cut-off events. [2024-11-10 14:43:55,495 INFO L125 PetriNetUnfolderBase]: For 5895/7986 co-relation queries the response was YES. [2024-11-10 14:43:55,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35579 conditions, 23308 events. 7241/23308 cut-off events. For 5895/7986 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 283809 event pairs, 4420 based on Foata normal form. 16/20550 useless extension candidates. Maximal degree in co-relation 35570. Up to 8528 conditions per place. [2024-11-10 14:43:55,606 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 36 selfloop transitions, 7 changer transitions 0/149 dead transitions. [2024-11-10 14:43:55,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 149 transitions, 472 flow [2024-11-10 14:43:55,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:43:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:43:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2024-11-10 14:43:55,607 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9072681704260651 [2024-11-10 14:43:55,607 INFO L175 Difference]: Start difference. First operand has 143 places, 131 transitions, 320 flow. Second operand 3 states and 362 transitions. [2024-11-10 14:43:55,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 149 transitions, 472 flow [2024-11-10 14:43:55,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 149 transitions, 462 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:43:55,611 INFO L231 Difference]: Finished difference. Result has 142 places, 137 transitions, 364 flow [2024-11-10 14:43:55,611 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=142, PETRI_TRANSITIONS=137} [2024-11-10 14:43:55,611 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 6 predicate places. [2024-11-10 14:43:55,611 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 137 transitions, 364 flow [2024-11-10 14:43:55,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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:55,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:55,611 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] [2024-11-10 14:43:55,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 14:43:55,612 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:43:55,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:55,612 INFO L85 PathProgramCache]: Analyzing trace with hash 459854307, now seen corresponding path program 1 times [2024-11-10 14:43:55,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:55,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813727126] [2024-11-10 14:43:55,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:55,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:55,643 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:43:55,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:55,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813727126] [2024-11-10 14:43:55,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813727126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:43:55,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:43:55,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:43:55,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244823333] [2024-11-10 14:43:55,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:43:55,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:43:55,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:55,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:43:55,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:43:55,671 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 133 [2024-11-10 14:43:55,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 137 transitions, 364 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 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:55,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:55,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 133 [2024-11-10 14:43:55,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:43:57,651 INFO L124 PetriNetUnfolderBase]: 5437/19606 cut-off events. [2024-11-10 14:43:57,651 INFO L125 PetriNetUnfolderBase]: For 2734/2800 co-relation queries the response was YES. [2024-11-10 14:43:57,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30029 conditions, 19606 events. 5437/19606 cut-off events. For 2734/2800 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 237190 event pairs, 2945 based on Foata normal form. 259/17469 useless extension candidates. Maximal degree in co-relation 30019. Up to 3835 conditions per place. [2024-11-10 14:43:57,753 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 40 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2024-11-10 14:43:57,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 158 transitions, 506 flow [2024-11-10 14:43:57,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:43:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 14:43:57,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 477 transitions. [2024-11-10 14:43:57,755 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8966165413533834 [2024-11-10 14:43:57,755 INFO L175 Difference]: Start difference. First operand has 142 places, 137 transitions, 364 flow. Second operand 4 states and 477 transitions. [2024-11-10 14:43:57,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 158 transitions, 506 flow [2024-11-10 14:43:57,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 158 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:43:57,766 INFO L231 Difference]: Finished difference. Result has 144 places, 138 transitions, 366 flow [2024-11-10 14:43:57,766 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=366, PETRI_PLACES=144, PETRI_TRANSITIONS=138} [2024-11-10 14:43:57,766 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 8 predicate places. [2024-11-10 14:43:57,766 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 138 transitions, 366 flow [2024-11-10 14:43:57,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 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:57,767 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:43:57,767 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] [2024-11-10 14:43:57,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 14:43:57,767 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:43:57,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:43:57,767 INFO L85 PathProgramCache]: Analyzing trace with hash -691305024, now seen corresponding path program 1 times [2024-11-10 14:43:57,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:43:57,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41198456] [2024-11-10 14:43:57,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:57,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:43:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:57,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:43:57,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41198456] [2024-11-10 14:43:57,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41198456] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:43:57,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723358086] [2024-11-10 14:43:57,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:43:57,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:43:57,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:43:57,825 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:43:57,826 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:43:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:43:57,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 14:43:57,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:43:57,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:57,969 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:43:58,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:43:58,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723358086] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:43:58,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:43:58,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2024-11-10 14:43:58,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88913937] [2024-11-10 14:43:58,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:43:58,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 14:43:58,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:43:58,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 14:43:58,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-10 14:43:58,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 133 [2024-11-10 14:43:58,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 138 transitions, 366 flow. Second operand has 13 states, 13 states have (on average 106.92307692307692) internal successors, (1390), 13 states have internal predecessors, (1390), 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:58,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:43:58,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 133 [2024-11-10 14:43:58,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:44:00,700 INFO L124 PetriNetUnfolderBase]: 6978/25580 cut-off events. [2024-11-10 14:44:00,700 INFO L125 PetriNetUnfolderBase]: For 3512/3512 co-relation queries the response was YES. [2024-11-10 14:44:00,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39127 conditions, 25580 events. 6978/25580 cut-off events. For 3512/3512 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 321654 event pairs, 1505 based on Foata normal form. 15/22116 useless extension candidates. Maximal degree in co-relation 39116. Up to 4886 conditions per place. [2024-11-10 14:44:00,850 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 58 selfloop transitions, 11 changer transitions 0/180 dead transitions. [2024-11-10 14:44:00,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 180 transitions, 590 flow [2024-11-10 14:44:00,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 14:44:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-10 14:44:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1121 transitions. [2024-11-10 14:44:00,852 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8428571428571429 [2024-11-10 14:44:00,852 INFO L175 Difference]: Start difference. First operand has 144 places, 138 transitions, 366 flow. Second operand 10 states and 1121 transitions. [2024-11-10 14:44:00,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 180 transitions, 590 flow [2024-11-10 14:44:00,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 180 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:44:00,876 INFO L231 Difference]: Finished difference. Result has 154 places, 144 transitions, 416 flow [2024-11-10 14:44:00,876 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=416, PETRI_PLACES=154, PETRI_TRANSITIONS=144} [2024-11-10 14:44:00,879 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 18 predicate places. [2024-11-10 14:44:00,879 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 144 transitions, 416 flow [2024-11-10 14:44:00,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 106.92307692307692) internal successors, (1390), 13 states have internal predecessors, (1390), 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:44:00,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:44:00,880 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:44:00,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 14:44:01,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:44:01,081 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:44:01,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:44:01,081 INFO L85 PathProgramCache]: Analyzing trace with hash 109235699, now seen corresponding path program 1 times [2024-11-10 14:44:01,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:44:01,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085335189] [2024-11-10 14:44:01,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:01,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:44:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:01,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:44:01,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:44:01,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085335189] [2024-11-10 14:44:01,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085335189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:44:01,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:44:01,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:44:01,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225835628] [2024-11-10 14:44:01,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:44:01,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:44:01,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:44:01,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:44:01,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:44:01,125 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2024-11-10 14:44:01,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 144 transitions, 416 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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:44:01,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:44:01,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2024-11-10 14:44:01,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:44:04,199 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L698-3-->L698-2: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][157], [139#true, Black: 160#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 448#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~threads_total~0#1|)), 452#true, Black: 266#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), 20#L686-3true, 164#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 131#true, 133#true, 134#true, 136#true, Black: 144#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 112#L698-2true, 78#L685-1true, Black: 154#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|)]) [2024-11-10 14:44:04,199 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2024-11-10 14:44:04,199 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-11-10 14:44:04,199 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-10 14:44:04,200 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2024-11-10 14:44:04,212 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L698-3-->L698-2: Formula: (= |v_#race~data~0_3| 0) InVars {} OutVars{#race~data~0=|v_#race~data~0_3|} AuxVars[] AssignedVars[#race~data~0][157], [139#true, Black: 160#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), Black: 448#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~threads_total~0#1|)), 452#true, Black: 266#(and (<= 4 |ULTIMATE.start_main_~threads_total~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1)), 164#(<= 4 |ULTIMATE.start_main_~threads_total~0#1|), 131#true, 133#true, 134#true, 81#L686true, 136#true, Black: 144#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 4 |ULTIMATE.start_main_~threads_total~0#1|)), 112#L698-2true, 78#L685-1true, Black: 154#(= |#race~data~0| |threadThread1of4ForFork0_#t~nondet2|)]) [2024-11-10 14:44:04,213 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2024-11-10 14:44:04,213 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-10 14:44:04,213 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-10 14:44:04,213 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-10 14:44:04,249 INFO L124 PetriNetUnfolderBase]: 8673/28773 cut-off events. [2024-11-10 14:44:04,249 INFO L125 PetriNetUnfolderBase]: For 11346/13484 co-relation queries the response was YES. [2024-11-10 14:44:04,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50304 conditions, 28773 events. 8673/28773 cut-off events. For 11346/13484 co-relation queries the response was YES. Maximal size of possible extension queue 1090. Compared 369577 event pairs, 5334 based on Foata normal form. 21/25865 useless extension candidates. Maximal degree in co-relation 50290. Up to 9950 conditions per place. [2024-11-10 14:44:04,426 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 38 selfloop transitions, 11 changer transitions 0/164 dead transitions. [2024-11-10 14:44:04,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 164 transitions, 593 flow [2024-11-10 14:44:04,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:44:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:44:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-11-10 14:44:04,427 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-10 14:44:04,427 INFO L175 Difference]: Start difference. First operand has 154 places, 144 transitions, 416 flow. Second operand 3 states and 361 transitions. [2024-11-10 14:44:04,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 164 transitions, 593 flow [2024-11-10 14:44:04,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 164 transitions, 585 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-10 14:44:04,450 INFO L231 Difference]: Finished difference. Result has 156 places, 153 transitions, 504 flow [2024-11-10 14:44:04,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=156, PETRI_TRANSITIONS=153} [2024-11-10 14:44:04,451 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 20 predicate places. [2024-11-10 14:44:04,451 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 153 transitions, 504 flow [2024-11-10 14:44:04,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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:44:04,451 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:44:04,451 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:44:04,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 14:44:04,452 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:44:04,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:44:04,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1711124427, now seen corresponding path program 1 times [2024-11-10 14:44:04,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:44:04,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437410120] [2024-11-10 14:44:04,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:04,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:44:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:04,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-10 14:44:04,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:44:04,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437410120] [2024-11-10 14:44:04,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437410120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:44:04,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:44:04,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:44:04,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824718197] [2024-11-10 14:44:04,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:44:04,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:44:04,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:44:04,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:44:04,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:44:04,655 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 133 [2024-11-10 14:44:04,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 153 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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:44:04,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:44:04,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 133 [2024-11-10 14:44:04,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:44:05,013 INFO L124 PetriNetUnfolderBase]: 472/4772 cut-off events. [2024-11-10 14:44:05,013 INFO L125 PetriNetUnfolderBase]: For 1657/1911 co-relation queries the response was YES. [2024-11-10 14:44:05,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7392 conditions, 4772 events. 472/4772 cut-off events. For 1657/1911 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 51339 event pairs, 234 based on Foata normal form. 128/4455 useless extension candidates. Maximal degree in co-relation 7377. Up to 454 conditions per place. [2024-11-10 14:44:05,037 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 16 selfloop transitions, 8 changer transitions 0/151 dead transitions. [2024-11-10 14:44:05,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 151 transitions, 531 flow [2024-11-10 14:44:05,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:44:05,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:44:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2024-11-10 14:44:05,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9273182957393483 [2024-11-10 14:44:05,038 INFO L175 Difference]: Start difference. First operand has 156 places, 153 transitions, 504 flow. Second operand 3 states and 370 transitions. [2024-11-10 14:44:05,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 151 transitions, 531 flow [2024-11-10 14:44:05,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 151 transitions, 519 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-10 14:44:05,046 INFO L231 Difference]: Finished difference. Result has 156 places, 144 transitions, 440 flow [2024-11-10 14:44:05,046 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=156, PETRI_TRANSITIONS=144} [2024-11-10 14:44:05,047 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 20 predicate places. [2024-11-10 14:44:05,047 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 144 transitions, 440 flow [2024-11-10 14:44:05,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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:44:05,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:44:05,047 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-10 14:44:05,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 14:44:05,047 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:44:05,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:44:05,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1044545544, now seen corresponding path program 1 times [2024-11-10 14:44:05,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:44:05,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433747455] [2024-11-10 14:44:05,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:05,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:44:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:05,072 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-11-10 14:44:05,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:44:05,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433747455] [2024-11-10 14:44:05,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433747455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:44:05,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:44:05,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:44:05,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022061107] [2024-11-10 14:44:05,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:44:05,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:44:05,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:44:05,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:44:05,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:44:05,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2024-11-10 14:44:05,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 144 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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:44:05,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:44:05,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2024-11-10 14:44:05,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:44:05,604 INFO L124 PetriNetUnfolderBase]: 928/5608 cut-off events. [2024-11-10 14:44:05,604 INFO L125 PetriNetUnfolderBase]: For 3649/3793 co-relation queries the response was YES. [2024-11-10 14:44:05,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10219 conditions, 5608 events. 928/5608 cut-off events. For 3649/3793 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 62070 event pairs, 707 based on Foata normal form. 7/5103 useless extension candidates. Maximal degree in co-relation 10204. Up to 1545 conditions per place. [2024-11-10 14:44:05,626 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 30 selfloop transitions, 4 changer transitions 0/151 dead transitions. [2024-11-10 14:44:05,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 151 transitions, 544 flow [2024-11-10 14:44:05,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:44:05,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:44:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2024-11-10 14:44:05,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8796992481203008 [2024-11-10 14:44:05,627 INFO L175 Difference]: Start difference. First operand has 156 places, 144 transitions, 440 flow. Second operand 3 states and 351 transitions. [2024-11-10 14:44:05,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 151 transitions, 544 flow [2024-11-10 14:44:05,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 151 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:44:05,633 INFO L231 Difference]: Finished difference. Result has 159 places, 147 transitions, 466 flow [2024-11-10 14:44:05,633 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=159, PETRI_TRANSITIONS=147} [2024-11-10 14:44:05,633 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 23 predicate places. [2024-11-10 14:44:05,633 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 147 transitions, 466 flow [2024-11-10 14:44:05,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 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:44:05,634 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:44:05,634 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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:44:05,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 14:44:05,634 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:44:05,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:44:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1035906389, now seen corresponding path program 1 times [2024-11-10 14:44:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:44:05,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663714652] [2024-11-10 14:44:05,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:05,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:44:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:05,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:44:05,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663714652] [2024-11-10 14:44:05,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663714652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:44:05,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362085970] [2024-11-10 14:44:05,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:05,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:44:05,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:44:05,752 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:44:05,753 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:44:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:05,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 14:44:05,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:44:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:06,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:44:06,133 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:06,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362085970] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:44:06,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:44:06,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2024-11-10 14:44:06,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909393853] [2024-11-10 14:44:06,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:44:06,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 14:44:06,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:44:06,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 14:44:06,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-10 14:44:06,248 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 133 [2024-11-10 14:44:06,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 147 transitions, 466 flow. Second operand has 19 states, 19 states have (on average 107.21052631578948) internal successors, (2037), 19 states have internal predecessors, (2037), 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:44:06,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:44:06,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 133 [2024-11-10 14:44:06,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:44:07,318 INFO L124 PetriNetUnfolderBase]: 1216/8404 cut-off events. [2024-11-10 14:44:07,318 INFO L125 PetriNetUnfolderBase]: For 3720/3986 co-relation queries the response was YES. [2024-11-10 14:44:07,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14034 conditions, 8404 events. 1216/8404 cut-off events. For 3720/3986 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 91048 event pairs, 181 based on Foata normal form. 20/7687 useless extension candidates. Maximal degree in co-relation 14017. Up to 893 conditions per place. [2024-11-10 14:44:07,363 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 84 selfloop transitions, 14 changer transitions 1/213 dead transitions. [2024-11-10 14:44:07,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 213 transitions, 872 flow [2024-11-10 14:44:07,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 14:44:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-10 14:44:07,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1570 transitions. [2024-11-10 14:44:07,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8431793770139635 [2024-11-10 14:44:07,365 INFO L175 Difference]: Start difference. First operand has 159 places, 147 transitions, 466 flow. Second operand 14 states and 1570 transitions. [2024-11-10 14:44:07,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 213 transitions, 872 flow [2024-11-10 14:44:07,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 213 transitions, 860 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-10 14:44:07,375 INFO L231 Difference]: Finished difference. Result has 174 places, 151 transitions, 521 flow [2024-11-10 14:44:07,375 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=521, PETRI_PLACES=174, PETRI_TRANSITIONS=151} [2024-11-10 14:44:07,375 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 38 predicate places. [2024-11-10 14:44:07,376 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 151 transitions, 521 flow [2024-11-10 14:44:07,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 107.21052631578948) internal successors, (2037), 19 states have internal predecessors, (2037), 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:44:07,376 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:44:07,376 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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:44:07,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 14:44:07,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:44:07,581 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:44:07,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:44:07,581 INFO L85 PathProgramCache]: Analyzing trace with hash 896612428, now seen corresponding path program 1 times [2024-11-10 14:44:07,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:44:07,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537312310] [2024-11-10 14:44:07,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:07,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:44:07,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-10 14:44:07,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:44:07,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537312310] [2024-11-10 14:44:07,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537312310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:44:07,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:44:07,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:44:07,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955779604] [2024-11-10 14:44:07,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:44:07,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:44:07,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:44:07,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:44:07,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:44:07,637 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2024-11-10 14:44:07,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 151 transitions, 521 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:44:07,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:44:07,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2024-11-10 14:44:07,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:44:08,112 INFO L124 PetriNetUnfolderBase]: 883/5676 cut-off events. [2024-11-10 14:44:08,113 INFO L125 PetriNetUnfolderBase]: For 4322/4418 co-relation queries the response was YES. [2024-11-10 14:44:08,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10742 conditions, 5676 events. 883/5676 cut-off events. For 4322/4418 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 62019 event pairs, 677 based on Foata normal form. 4/5178 useless extension candidates. Maximal degree in co-relation 10721. Up to 1476 conditions per place. [2024-11-10 14:44:08,138 INFO L140 encePairwiseOnDemand]: 128/133 looper letters, 30 selfloop transitions, 4 changer transitions 0/157 dead transitions. [2024-11-10 14:44:08,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 157 transitions, 616 flow [2024-11-10 14:44:08,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:44:08,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:44:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2024-11-10 14:44:08,139 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8771929824561403 [2024-11-10 14:44:08,139 INFO L175 Difference]: Start difference. First operand has 174 places, 151 transitions, 521 flow. Second operand 3 states and 350 transitions. [2024-11-10 14:44:08,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 157 transitions, 616 flow [2024-11-10 14:44:08,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 157 transitions, 598 flow, removed 2 selfloop flow, removed 7 redundant places. [2024-11-10 14:44:08,158 INFO L231 Difference]: Finished difference. Result has 171 places, 154 transitions, 539 flow [2024-11-10 14:44:08,158 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=539, PETRI_PLACES=171, PETRI_TRANSITIONS=154} [2024-11-10 14:44:08,158 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 35 predicate places. [2024-11-10 14:44:08,158 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 154 transitions, 539 flow [2024-11-10 14:44:08,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:44:08,159 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:44:08,159 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:44:08,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-10 14:44:08,159 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:44:08,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:44:08,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1593136399, now seen corresponding path program 1 times [2024-11-10 14:44:08,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:44:08,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453527707] [2024-11-10 14:44:08,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:08,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:44:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 103 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:08,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:44:08,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453527707] [2024-11-10 14:44:08,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453527707] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:44:08,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467686694] [2024-11-10 14:44:08,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:08,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:44:08,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:44:08,293 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:44:08,294 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:44:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:08,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 14:44:08,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:44:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:08,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:44:08,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467686694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:44:08,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 14:44:08,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 21 [2024-11-10 14:44:08,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27508344] [2024-11-10 14:44:08,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:44:08,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 14:44:08,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:44:08,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 14:44:08,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2024-11-10 14:44:08,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 133 [2024-11-10 14:44:08,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 154 transitions, 539 flow. Second operand has 12 states, 12 states have (on average 108.0) internal successors, (1296), 12 states have internal predecessors, (1296), 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:44:08,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:44:08,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 133 [2024-11-10 14:44:08,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:44:09,640 INFO L124 PetriNetUnfolderBase]: 1126/7909 cut-off events. [2024-11-10 14:44:09,640 INFO L125 PetriNetUnfolderBase]: For 5117/5421 co-relation queries the response was YES. [2024-11-10 14:44:09,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14214 conditions, 7909 events. 1126/7909 cut-off events. For 5117/5421 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 85810 event pairs, 151 based on Foata normal form. 48/7239 useless extension candidates. Maximal degree in co-relation 14192. Up to 557 conditions per place. [2024-11-10 14:44:09,677 INFO L140 encePairwiseOnDemand]: 125/133 looper letters, 89 selfloop transitions, 16 changer transitions 8/230 dead transitions. [2024-11-10 14:44:09,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 230 transitions, 986 flow [2024-11-10 14:44:09,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 14:44:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-10 14:44:09,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1810 transitions. [2024-11-10 14:44:09,679 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8505639097744361 [2024-11-10 14:44:09,679 INFO L175 Difference]: Start difference. First operand has 171 places, 154 transitions, 539 flow. Second operand 16 states and 1810 transitions. [2024-11-10 14:44:09,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 230 transitions, 986 flow [2024-11-10 14:44:09,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 230 transitions, 964 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-11-10 14:44:09,689 INFO L231 Difference]: Finished difference. Result has 179 places, 152 transitions, 534 flow [2024-11-10 14:44:09,689 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=534, PETRI_PLACES=179, PETRI_TRANSITIONS=152} [2024-11-10 14:44:09,689 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 43 predicate places. [2024-11-10 14:44:09,690 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 152 transitions, 534 flow [2024-11-10 14:44:09,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 108.0) internal successors, (1296), 12 states have internal predecessors, (1296), 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:44:09,690 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:44:09,690 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 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:44:09,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 14:44:09,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-10 14:44:09,891 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:44:09,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:44:09,891 INFO L85 PathProgramCache]: Analyzing trace with hash -883772479, now seen corresponding path program 1 times [2024-11-10 14:44:09,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:44:09,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105650976] [2024-11-10 14:44:09,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:09,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:44:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-10 14:44:10,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:44:10,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105650976] [2024-11-10 14:44:10,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105650976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:44:10,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:44:10,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:44:10,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482914508] [2024-11-10 14:44:10,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:44:10,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:44:10,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:44:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:44:10,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:44:10,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 133 [2024-11-10 14:44:10,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 152 transitions, 534 flow. Second operand has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 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:44:10,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:44:10,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 133 [2024-11-10 14:44:10,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:44:11,043 INFO L124 PetriNetUnfolderBase]: 2470/9488 cut-off events. [2024-11-10 14:44:11,044 INFO L125 PetriNetUnfolderBase]: For 3949/4177 co-relation queries the response was YES. [2024-11-10 14:44:11,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18891 conditions, 9488 events. 2470/9488 cut-off events. For 3949/4177 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 98954 event pairs, 1086 based on Foata normal form. 0/8769 useless extension candidates. Maximal degree in co-relation 18870. Up to 2061 conditions per place. [2024-11-10 14:44:11,085 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 59 selfloop transitions, 6 changer transitions 0/183 dead transitions. [2024-11-10 14:44:11,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 183 transitions, 758 flow [2024-11-10 14:44:11,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:44:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:44:11,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2024-11-10 14:44:11,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.818295739348371 [2024-11-10 14:44:11,086 INFO L175 Difference]: Start difference. First operand has 179 places, 152 transitions, 534 flow. Second operand 6 states and 653 transitions. [2024-11-10 14:44:11,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 183 transitions, 758 flow [2024-11-10 14:44:11,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 183 transitions, 704 flow, removed 3 selfloop flow, removed 17 redundant places. [2024-11-10 14:44:11,121 INFO L231 Difference]: Finished difference. Result has 166 places, 151 transitions, 490 flow [2024-11-10 14:44:11,122 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=166, PETRI_TRANSITIONS=151} [2024-11-10 14:44:11,122 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 30 predicate places. [2024-11-10 14:44:11,122 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 151 transitions, 490 flow [2024-11-10 14:44:11,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 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:44:11,122 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:44:11,122 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2024-11-10 14:44:11,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-10 14:44:11,123 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:44:11,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:44:11,123 INFO L85 PathProgramCache]: Analyzing trace with hash 18819014, now seen corresponding path program 1 times [2024-11-10 14:44:11,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:44:11,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134956584] [2024-11-10 14:44:11,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:11,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:44:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-10 14:44:11,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:44:11,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134956584] [2024-11-10 14:44:11,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134956584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:44:11,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:44:11,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:44:11,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047377346] [2024-11-10 14:44:11,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:44:11,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:44:11,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:44:11,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:44:11,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:44:11,174 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 133 [2024-11-10 14:44:11,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 151 transitions, 490 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:44:11,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:44:11,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 133 [2024-11-10 14:44:11,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:44:12,048 INFO L124 PetriNetUnfolderBase]: 1353/8900 cut-off events. [2024-11-10 14:44:12,049 INFO L125 PetriNetUnfolderBase]: For 5251/5335 co-relation queries the response was YES. [2024-11-10 14:44:12,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16942 conditions, 8900 events. 1353/8900 cut-off events. For 5251/5335 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 106256 event pairs, 605 based on Foata normal form. 0/8340 useless extension candidates. Maximal degree in co-relation 16923. Up to 1591 conditions per place. [2024-11-10 14:44:12,088 INFO L140 encePairwiseOnDemand]: 126/133 looper letters, 30 selfloop transitions, 9 changer transitions 1/164 dead transitions. [2024-11-10 14:44:12,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 164 transitions, 624 flow [2024-11-10 14:44:12,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:44:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:44:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2024-11-10 14:44:12,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2024-11-10 14:44:12,089 INFO L175 Difference]: Start difference. First operand has 166 places, 151 transitions, 490 flow. Second operand 3 states and 361 transitions. [2024-11-10 14:44:12,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 164 transitions, 624 flow [2024-11-10 14:44:12,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 164 transitions, 612 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:44:12,135 INFO L231 Difference]: Finished difference. Result has 165 places, 155 transitions, 554 flow [2024-11-10 14:44:12,135 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=165, PETRI_TRANSITIONS=155} [2024-11-10 14:44:12,135 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 29 predicate places. [2024-11-10 14:44:12,136 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 155 transitions, 554 flow [2024-11-10 14:44:12,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 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:44:12,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:44:12,136 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:44:12,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-10 14:44:12,136 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:44:12,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:44:12,137 INFO L85 PathProgramCache]: Analyzing trace with hash -227435589, now seen corresponding path program 1 times [2024-11-10 14:44:12,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:44:12,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845802095] [2024-11-10 14:44:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:12,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:44:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-10 14:44:12,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:44:12,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845802095] [2024-11-10 14:44:12,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845802095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:44:12,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501099095] [2024-11-10 14:44:12,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:12,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:44:12,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:44:12,260 INFO L229 MonitoredProcess]: Starting monitored process 7 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:44:12,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 14:44:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:12,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:44:12,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:44:12,525 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-10 14:44:12,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:44:12,643 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-10 14:44:12,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501099095] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:44:12,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:44:12,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 14:44:12,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084857637] [2024-11-10 14:44:12,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:44:12,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 14:44:12,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:44:12,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 14:44:12,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-10 14:44:12,717 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 133 [2024-11-10 14:44:12,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 155 transitions, 554 flow. Second operand has 10 states, 10 states have (on average 110.5) internal successors, (1105), 10 states have internal predecessors, (1105), 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:44:12,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:44:12,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 133 [2024-11-10 14:44:12,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:44:13,439 INFO L124 PetriNetUnfolderBase]: 1022/5699 cut-off events. [2024-11-10 14:44:13,439 INFO L125 PetriNetUnfolderBase]: For 3745/3941 co-relation queries the response was YES. [2024-11-10 14:44:13,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10788 conditions, 5699 events. 1022/5699 cut-off events. For 3745/3941 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 57088 event pairs, 238 based on Foata normal form. 80/5659 useless extension candidates. Maximal degree in co-relation 10768. Up to 562 conditions per place. [2024-11-10 14:44:13,465 INFO L140 encePairwiseOnDemand]: 127/133 looper letters, 53 selfloop transitions, 7 changer transitions 8/198 dead transitions. [2024-11-10 14:44:13,465 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 198 transitions, 830 flow [2024-11-10 14:44:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:44:13,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:44:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 711 transitions. [2024-11-10 14:44:13,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8909774436090225 [2024-11-10 14:44:13,466 INFO L175 Difference]: Start difference. First operand has 165 places, 155 transitions, 554 flow. Second operand 6 states and 711 transitions. [2024-11-10 14:44:13,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 198 transitions, 830 flow [2024-11-10 14:44:13,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 198 transitions, 812 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:44:13,478 INFO L231 Difference]: Finished difference. Result has 170 places, 157 transitions, 568 flow [2024-11-10 14:44:13,478 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=568, PETRI_PLACES=170, PETRI_TRANSITIONS=157} [2024-11-10 14:44:13,478 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 34 predicate places. [2024-11-10 14:44:13,478 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 157 transitions, 568 flow [2024-11-10 14:44:13,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.5) internal successors, (1105), 10 states have internal predecessors, (1105), 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:44:13,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:44:13,479 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:44:13,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 14:44:13,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-10 14:44:13,680 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:44:13,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:44:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1053927212, now seen corresponding path program 1 times [2024-11-10 14:44:13,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:44:13,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010341482] [2024-11-10 14:44:13,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:13,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:44:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:14,499 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 6 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:14,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:44:14,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010341482] [2024-11-10 14:44:14,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010341482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:44:14,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953909885] [2024-11-10 14:44:14,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:14,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:44:14,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:44:14,502 INFO L229 MonitoredProcess]: Starting monitored process 8 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:44:14,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 14:44:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:14,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-10 14:44:14,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:44:14,905 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 1 [2024-11-10 14:44:15,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:44:15,038 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 29 treesize of output 13 [2024-11-10 14:44:15,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 14:44:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 6 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:15,309 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:44:15,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-10 14:44:15,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-11-10 14:44:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 6 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:15,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953909885] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:44:15,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:44:15,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 18] total 55 [2024-11-10 14:44:15,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482624554] [2024-11-10 14:44:15,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:44:15,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-11-10 14:44:15,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:44:15,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-11-10 14:44:15,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2711, Unknown=0, NotChecked=0, Total=2970 [2024-11-10 14:44:17,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:19,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:20,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:22,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:24,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:26,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:28,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:28,885 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 133 [2024-11-10 14:44:28,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 157 transitions, 568 flow. Second operand has 55 states, 55 states have (on average 92.45454545454545) internal successors, (5085), 55 states have internal predecessors, (5085), 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:44:28,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:44:28,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 133 [2024-11-10 14:44:28,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:44:31,182 INFO L124 PetriNetUnfolderBase]: 2162/7805 cut-off events. [2024-11-10 14:44:31,182 INFO L125 PetriNetUnfolderBase]: For 4458/4654 co-relation queries the response was YES. [2024-11-10 14:44:31,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17049 conditions, 7805 events. 2162/7805 cut-off events. For 4458/4654 co-relation queries the response was YES. Maximal size of possible extension queue 259. Compared 75905 event pairs, 98 based on Foata normal form. 24/7600 useless extension candidates. Maximal degree in co-relation 17027. Up to 1108 conditions per place. [2024-11-10 14:44:31,221 INFO L140 encePairwiseOnDemand]: 115/133 looper letters, 152 selfloop transitions, 28 changer transitions 8/293 dead transitions. [2024-11-10 14:44:31,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 293 transitions, 1335 flow [2024-11-10 14:44:31,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 14:44:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-10 14:44:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 2413 transitions. [2024-11-10 14:44:31,224 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7257142857142858 [2024-11-10 14:44:31,224 INFO L175 Difference]: Start difference. First operand has 170 places, 157 transitions, 568 flow. Second operand 25 states and 2413 transitions. [2024-11-10 14:44:31,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 293 transitions, 1335 flow [2024-11-10 14:44:31,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 293 transitions, 1327 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-11-10 14:44:31,236 INFO L231 Difference]: Finished difference. Result has 200 places, 165 transitions, 668 flow [2024-11-10 14:44:31,236 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=668, PETRI_PLACES=200, PETRI_TRANSITIONS=165} [2024-11-10 14:44:31,236 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 64 predicate places. [2024-11-10 14:44:31,236 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 165 transitions, 668 flow [2024-11-10 14:44:31,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 92.45454545454545) internal successors, (5085), 55 states have internal predecessors, (5085), 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:44:31,238 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:44:31,238 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:44:31,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 14:44:31,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:44:31,439 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:44:31,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:44:31,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1519402068, now seen corresponding path program 2 times [2024-11-10 14:44:31,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:44:31,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629862992] [2024-11-10 14:44:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:31,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:44:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:44:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 6 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:32,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:44:32,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629862992] [2024-11-10 14:44:32,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629862992] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:44:32,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96429814] [2024-11-10 14:44:32,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:44:32,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:44:32,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:44:32,502 INFO L229 MonitoredProcess]: Starting monitored process 9 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:44:32,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 14:44:32,643 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:44:32,643 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:44:32,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 14:44:32,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:44:33,102 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 1 [2024-11-10 14:44:33,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 14:44:33,255 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 29 treesize of output 13 [2024-11-10 14:44:33,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-10 14:44:33,446 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 6 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:33,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:44:33,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-10 14:44:33,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2024-11-10 14:44:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 6 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:44:34,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96429814] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:44:34,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:44:34,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 19] total 59 [2024-11-10 14:44:34,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498871134] [2024-11-10 14:44:34,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:44:34,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-10 14:44:34,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:44:34,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-10 14:44:34,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=3142, Unknown=0, NotChecked=0, Total=3422 [2024-11-10 14:44:36,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:37,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:39,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:40,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:42,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:44,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:45,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:47,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:48,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-10 14:44:48,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 133 [2024-11-10 14:44:48,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 165 transitions, 668 flow. Second operand has 59 states, 59 states have (on average 90.61016949152543) internal successors, (5346), 59 states have internal predecessors, (5346), 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:44:48,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:44:48,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 133 [2024-11-10 14:44:48,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:44:51,099 INFO L124 PetriNetUnfolderBase]: 1894/7234 cut-off events. [2024-11-10 14:44:51,100 INFO L125 PetriNetUnfolderBase]: For 5420/5584 co-relation queries the response was YES. [2024-11-10 14:44:51,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16581 conditions, 7234 events. 1894/7234 cut-off events. For 5420/5584 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 68911 event pairs, 118 based on Foata normal form. 24/7028 useless extension candidates. Maximal degree in co-relation 16551. Up to 982 conditions per place. [2024-11-10 14:44:51,142 INFO L140 encePairwiseOnDemand]: 115/133 looper letters, 150 selfloop transitions, 29 changer transitions 8/289 dead transitions. [2024-11-10 14:44:51,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 289 transitions, 1426 flow [2024-11-10 14:44:51,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-10 14:44:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-10 14:44:51,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2449 transitions. [2024-11-10 14:44:51,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7082128397917872 [2024-11-10 14:44:51,146 INFO L175 Difference]: Start difference. First operand has 200 places, 165 transitions, 668 flow. Second operand 26 states and 2449 transitions. [2024-11-10 14:44:51,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 289 transitions, 1426 flow [2024-11-10 14:44:51,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 289 transitions, 1383 flow, removed 1 selfloop flow, removed 17 redundant places. [2024-11-10 14:44:51,162 INFO L231 Difference]: Finished difference. Result has 212 places, 168 transitions, 716 flow [2024-11-10 14:44:51,162 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=133, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=716, PETRI_PLACES=212, PETRI_TRANSITIONS=168} [2024-11-10 14:44:51,162 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, 76 predicate places. [2024-11-10 14:44:51,162 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 168 transitions, 716 flow [2024-11-10 14:44:51,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 90.61016949152543) internal successors, (5346), 59 states have internal predecessors, (5346), 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:44:51,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:44:51,165 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:44:51,177 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 14:44:51,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2024-11-10 14:44:51,365 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-10 14:44:51,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:44:51,366 INFO L85 PathProgramCache]: Analyzing trace with hash 739500603, now seen corresponding path program 1 times [2024-11-10 14:44:51,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:44:51,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361665321] [2024-11-10 14:44:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:44:51,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:44:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:44:51,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:44:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:44:51,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:44:51,460 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:44:51,461 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2024-11-10 14:44:51,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-10 14:44:51,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-10 14:44:51,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-10 14:44:51,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2024-11-10 14:44:51,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-10 14:44:51,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-10 14:44:51,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-10 14:44:51,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-10 14:44:51,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-10 14:44:51,462 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:44:51,573 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2024-11-10 14:44:51,576 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:44:51,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:44:51 BasicIcfg [2024-11-10 14:44:51,582 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:44:51,582 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:44:51,583 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:44:51,583 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:44:51,583 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:43:43" (3/4) ... [2024-11-10 14:44:51,584 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 14:44:51,690 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:44:51,690 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:44:51,690 INFO L158 Benchmark]: Toolchain (without parser) took 69059.74ms. Allocated memory was 188.7MB in the beginning and 10.0GB in the end (delta: 9.8GB). Free memory was 112.1MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 5.8GB. Max. memory is 16.1GB. [2024-11-10 14:44:51,690 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory is still 159.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:44:51,691 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.54ms. Allocated memory is still 188.7MB. Free memory was 111.7MB in the beginning and 90.1MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 14:44:51,691 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.15ms. Allocated memory is still 188.7MB. Free memory was 90.1MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:44:51,691 INFO L158 Benchmark]: Boogie Preprocessor took 19.15ms. Allocated memory is still 188.7MB. Free memory was 88.1MB in the beginning and 86.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:44:51,691 INFO L158 Benchmark]: IcfgBuilder took 352.55ms. Allocated memory is still 188.7MB. Free memory was 86.5MB in the beginning and 147.3MB in the end (delta: -60.8MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-10 14:44:51,692 INFO L158 Benchmark]: TraceAbstraction took 68142.66ms. Allocated memory was 188.7MB in the beginning and 10.0GB in the end (delta: 9.8GB). Free memory was 146.3MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 5.8GB. Max. memory is 16.1GB. [2024-11-10 14:44:51,692 INFO L158 Benchmark]: Witness Printer took 107.48ms. Allocated memory is still 10.0GB. Free memory was 4.1GB in the beginning and 4.1GB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-10 14:44:51,693 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 188.7MB. Free memory is still 159.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.54ms. Allocated memory is still 188.7MB. Free memory was 111.7MB in the beginning and 90.1MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.15ms. Allocated memory is still 188.7MB. Free memory was 90.1MB in the beginning and 88.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.15ms. Allocated memory is still 188.7MB. Free memory was 88.1MB in the beginning and 86.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 352.55ms. Allocated memory is still 188.7MB. Free memory was 86.5MB in the beginning and 147.3MB in the end (delta: -60.8MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 68142.66ms. Allocated memory was 188.7MB in the beginning and 10.0GB in the end (delta: 9.8GB). Free memory was 146.3MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 5.8GB. Max. memory is 16.1GB. * Witness Printer took 107.48ms. Allocated memory is still 10.0GB. Free memory was 4.1GB in the beginning and 4.1GB in the end (delta: 54.5MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 685]: Data race detected Data race detected The following path leads to a data race: [L681] 0 int data = 0; VAL [data=0] [L682] 0 pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } }; VAL [data=0, data_mutex={1:0}] [L690] 0 int threads_total = 4; VAL [data=0, data_mutex={1:0}, threads_total=4] [L691] 0 pthread_t tids[4]; VAL [data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L692] 0 int i = 0; VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L685] 1 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L685] 3 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L687] 3 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L692] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L693] 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L693] FCALL, FORK 0 pthread_create(&tids[i], ((void *)0), &thread, ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={17:0}] [L692] 0 i++ VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L692] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L695] 0 int i = 0; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L696] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L687] 1 return ((void *)0); VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L696] FCALL, JOIN 1 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, threads_total=4, tids={17:0}] [L695] 0 i += 2 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L695] COND TRUE 0 i < threads_total VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L696] EXPR 0 tids[i] VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L696] 0 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L696] FCALL, JOIN 3 pthread_join(tids[i], ((void *)0)) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={17:0}] [L695] 0 i += 2 VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L695] COND FALSE 0 !(i < threads_total) VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={17:0}] [L685] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] [L698] 0 return data; VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}, threads_total=4, tids={17:0}] [L685] 2 data = __VERIFIER_nondet_int() VAL [\old(arg)={0:0}, \result={0:0}, arg={0:0}, data=0, data_mutex={1:0}] Now there is a data race on ~data~0 between C: return data; [698] and C: data = __VERIFIER_nondet_int() [685] - UnprovableResult [Line: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 94 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 217 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 115 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 250 IncrementalHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 25 mSDtfsCounter, 250 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=4, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 111 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 349 mSDsluCounter, 71 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 557 IncrementalHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 19 mSDtfsCounter, 557 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=5, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 419 NumberOfCodeBlocks, 419 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 391 ConstructedInterpolants, 0 QuantifiedInterpolants, 948 SizeOfPredicates, 4 NumberOfNonLiveVariables, 118 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 26/32 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 128 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 10, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 487 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 353 mSDsluCounter, 90 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 905 IncrementalHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 29 mSDtfsCounter, 905 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=7, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 509 NumberOfCodeBlocks, 509 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 462 ConstructedInterpolants, 0 QuantifiedInterpolants, 1021 SizeOfPredicates, 4 NumberOfNonLiveVariables, 118 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 68/74 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 145 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 61.1s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 52.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 mSolverCounterUnknown, 4069 SdHoareTripleChecker+Valid, 30.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3720 mSDsluCounter, 6373 SdHoareTripleChecker+Invalid, 29.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6251 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27002 IncrementalHoareTripleChecker+Invalid, 27079 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 122 mSDtfsCounter, 27002 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1390 GetRequests, 1149 SyntacticMatches, 7 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=716occurred in iteration=17, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2139 NumberOfCodeBlocks, 2139 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2523 ConstructedInterpolants, 44 QuantifiedInterpolants, 14853 SizeOfPredicates, 60 NumberOfNonLiveVariables, 1772 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 28 InterpolantComputations, 12 PerfectInterpolantSequences, 1035/2024 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 14:44:51,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE