./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.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/goblint-regression/28-race_reach_36-indirect_racefree.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 3eff698bae51c39e8a3a4c763800dbda831dabb73a169fa31c8e326faee47cd8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:33:24,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:33:24,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:33:24,573 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:33:24,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:33:24,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:33:24,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:33:24,615 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:33:24,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:33:24,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:33:24,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:33:24,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:33:24,621 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:33:24,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:33:24,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:33:24,622 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:33:24,622 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:33:24,622 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:33:24,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:33:24,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:33:24,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:33:24,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:33:24,625 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:33:24,625 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:33:24,625 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:33:24,625 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:33:24,626 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:33:24,626 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:33:24,626 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:33:24,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:33:24,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:33:24,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:33:24,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:33:24,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:33:24,628 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:33:24,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:33:24,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:33:24,629 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:33:24,630 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:33:24,630 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:33:24,630 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:33:24,630 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 -> 3eff698bae51c39e8a3a4c763800dbda831dabb73a169fa31c8e326faee47cd8 [2024-11-10 14:33:24,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:33:24,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:33:24,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:33:24,917 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:33:24,917 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:33:24,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i [2024-11-10 14:33:26,343 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:33:26,646 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:33:26,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_36-indirect_racefree.i [2024-11-10 14:33:26,660 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8186a978d/f8992747d2ea4fa5bd33e6c17280e8a1/FLAGaec56a938 [2024-11-10 14:33:26,673 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8186a978d/f8992747d2ea4fa5bd33e6c17280e8a1 [2024-11-10 14:33:26,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:33:26,678 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:33:26,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:33:26,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:33:26,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:33:26,685 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:33:26" (1/1) ... [2024-11-10 14:33:26,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d77b712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:26, skipping insertion in model container [2024-11-10 14:33:26,686 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:33:26" (1/1) ... [2024-11-10 14:33:26,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:33:27,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:33:27,094 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:33:27,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:33:27,185 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:33:27,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:27 WrapperNode [2024-11-10 14:33:27,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:33:27,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:33:27,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:33:27,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:33:27,193 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:33:27" (1/1) ... [2024-11-10 14:33:27,214 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:33:27" (1/1) ... [2024-11-10 14:33:27,244 INFO L138 Inliner]: procedures = 171, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 111 [2024-11-10 14:33:27,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:33:27,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:33:27,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:33:27,249 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:33:27,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:27" (1/1) ... [2024-11-10 14:33:27,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:27" (1/1) ... [2024-11-10 14:33:27,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:27" (1/1) ... [2024-11-10 14:33:27,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:27" (1/1) ... [2024-11-10 14:33:27,277 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:27" (1/1) ... [2024-11-10 14:33:27,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:27" (1/1) ... [2024-11-10 14:33:27,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:27" (1/1) ... [2024-11-10 14:33:27,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:27" (1/1) ... [2024-11-10 14:33:27,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:33:27,286 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:33:27,286 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:33:27,286 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:33:27,287 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:27" (1/1) ... [2024-11-10 14:33:27,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:33:27,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:33:27,327 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:33:27,330 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:33:27,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:33:27,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:33:27,374 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:33:27,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:33:27,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:33:27,374 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 14:33:27,375 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 14:33:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:33:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:33:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:33:27,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:33:27,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:33:27,377 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:33:27,497 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:33:27,499 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:33:27,735 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2024-11-10 14:33:27,736 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2024-11-10 14:33:27,844 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:33:27,844 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:33:27,892 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:33:27,893 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:33:27,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:33:27 BoogieIcfgContainer [2024-11-10 14:33:27,894 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:33:27,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:33:27,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:33:27,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:33:27,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:33:26" (1/3) ... [2024-11-10 14:33:27,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42dc75bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:33:27, skipping insertion in model container [2024-11-10 14:33:27,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:33:27" (2/3) ... [2024-11-10 14:33:27,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42dc75bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:33:27, skipping insertion in model container [2024-11-10 14:33:27,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:33:27" (3/3) ... [2024-11-10 14:33:27,905 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_36-indirect_racefree.i [2024-11-10 14:33:27,924 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:33:27,924 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations. [2024-11-10 14:33:27,925 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:33:28,019 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 14:33:28,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 194 transitions, 395 flow [2024-11-10 14:33:28,156 INFO L124 PetriNetUnfolderBase]: 19/264 cut-off events. [2024-11-10 14:33:28,157 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:33:28,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 264 events. 19/264 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 820 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 144. Up to 4 conditions per place. [2024-11-10 14:33:28,166 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 194 transitions, 395 flow [2024-11-10 14:33:28,174 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 194 transitions, 395 flow [2024-11-10 14:33:28,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:33:28,198 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;@43040bd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:33:28,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-10 14:33:28,210 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:33:28,210 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-11-10 14:33:28,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:33:28,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:28,212 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] [2024-11-10 14:33:28,212 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:28,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:28,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1051543775, now seen corresponding path program 1 times [2024-11-10 14:33:28,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:28,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332746286] [2024-11-10 14:33:28,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:28,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:28,551 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:33:28,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:28,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332746286] [2024-11-10 14:33:28,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332746286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:28,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:28,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:28,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612629657] [2024-11-10 14:33:28,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:28,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:28,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:28,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:28,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:28,628 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 194 [2024-11-10 14:33:28,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 194 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:33:28,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:28,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 194 [2024-11-10 14:33:28,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:28,834 INFO L124 PetriNetUnfolderBase]: 37/661 cut-off events. [2024-11-10 14:33:28,835 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:33:28,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 661 events. 37/661 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3014 event pairs, 36 based on Foata normal form. 84/681 useless extension candidates. Maximal degree in co-relation 634. Up to 97 conditions per place. [2024-11-10 14:33:28,843 INFO L140 encePairwiseOnDemand]: 179/194 looper letters, 18 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2024-11-10 14:33:28,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 179 transitions, 405 flow [2024-11-10 14:33:28,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:28,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:28,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2024-11-10 14:33:28,863 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8814432989690721 [2024-11-10 14:33:28,867 INFO L175 Difference]: Start difference. First operand has 184 places, 194 transitions, 395 flow. Second operand 3 states and 513 transitions. [2024-11-10 14:33:28,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 179 transitions, 405 flow [2024-11-10 14:33:28,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 179 transitions, 405 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:28,877 INFO L231 Difference]: Finished difference. Result has 183 places, 179 transitions, 369 flow [2024-11-10 14:33:28,880 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=369, PETRI_PLACES=183, PETRI_TRANSITIONS=179} [2024-11-10 14:33:28,883 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -1 predicate places. [2024-11-10 14:33:28,886 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 179 transitions, 369 flow [2024-11-10 14:33:28,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:33:28,887 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:28,888 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:28,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:33:28,889 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:28,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:28,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1216246335, now seen corresponding path program 1 times [2024-11-10 14:33:28,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317955176] [2024-11-10 14:33:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:28,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:28,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:28,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:28,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317955176] [2024-11-10 14:33:28,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317955176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:28,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:28,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:28,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213215009] [2024-11-10 14:33:28,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:28,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:28,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:28,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:28,996 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2024-11-10 14:33:28,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 179 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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:33:28,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:28,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2024-11-10 14:33:28,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:29,118 INFO L124 PetriNetUnfolderBase]: 37/658 cut-off events. [2024-11-10 14:33:29,119 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:33:29,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762 conditions, 658 events. 37/658 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3050 event pairs, 36 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 722. Up to 94 conditions per place. [2024-11-10 14:33:29,124 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 16 selfloop transitions, 1 changer transitions 0/177 dead transitions. [2024-11-10 14:33:29,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 177 transitions, 399 flow [2024-11-10 14:33:29,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:29,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2024-11-10 14:33:29,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8676975945017182 [2024-11-10 14:33:29,128 INFO L175 Difference]: Start difference. First operand has 183 places, 179 transitions, 369 flow. Second operand 3 states and 505 transitions. [2024-11-10 14:33:29,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 177 transitions, 399 flow [2024-11-10 14:33:29,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 177 transitions, 395 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:29,134 INFO L231 Difference]: Finished difference. Result has 181 places, 177 transitions, 363 flow [2024-11-10 14:33:29,134 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=363, PETRI_PLACES=181, PETRI_TRANSITIONS=177} [2024-11-10 14:33:29,135 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -3 predicate places. [2024-11-10 14:33:29,135 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 177 transitions, 363 flow [2024-11-10 14:33:29,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.0) internal successors, (489), 3 states have internal predecessors, (489), 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:33:29,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:29,136 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:29,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:33:29,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:29,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:29,138 INFO L85 PathProgramCache]: Analyzing trace with hash -586999227, now seen corresponding path program 1 times [2024-11-10 14:33:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:29,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709248658] [2024-11-10 14:33:29,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:29,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:29,190 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:33:29,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:29,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709248658] [2024-11-10 14:33:29,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709248658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:29,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:29,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:29,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825078810] [2024-11-10 14:33:29,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:29,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:29,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:29,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:29,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:29,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 194 [2024-11-10 14:33:29,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 177 transitions, 363 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:33:29,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:29,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 194 [2024-11-10 14:33:29,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:29,398 INFO L124 PetriNetUnfolderBase]: 41/597 cut-off events. [2024-11-10 14:33:29,398 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:33:29,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 597 events. 41/597 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2678 event pairs, 40 based on Foata normal form. 0/541 useless extension candidates. Maximal degree in co-relation 672. Up to 104 conditions per place. [2024-11-10 14:33:29,420 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 18 selfloop transitions, 2 changer transitions 0/176 dead transitions. [2024-11-10 14:33:29,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 176 transitions, 401 flow [2024-11-10 14:33:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:29,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:29,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2024-11-10 14:33:29,423 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8608247422680413 [2024-11-10 14:33:29,423 INFO L175 Difference]: Start difference. First operand has 181 places, 177 transitions, 363 flow. Second operand 3 states and 501 transitions. [2024-11-10 14:33:29,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 176 transitions, 401 flow [2024-11-10 14:33:29,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 176 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:33:29,432 INFO L231 Difference]: Finished difference. Result has 181 places, 176 transitions, 364 flow [2024-11-10 14:33:29,432 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=181, PETRI_TRANSITIONS=176} [2024-11-10 14:33:29,433 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, -3 predicate places. [2024-11-10 14:33:29,433 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 176 transitions, 364 flow [2024-11-10 14:33:29,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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:33:29,434 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:29,434 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:29,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:33:29,434 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:29,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:29,441 INFO L85 PathProgramCache]: Analyzing trace with hash -776567235, now seen corresponding path program 1 times [2024-11-10 14:33:29,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:29,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705496056] [2024-11-10 14:33:29,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:29,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:30,034 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:33:30,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:30,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705496056] [2024-11-10 14:33:30,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705496056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:30,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:30,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:33:30,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403813202] [2024-11-10 14:33:30,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:30,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:33:30,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:30,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:33:30,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:30,247 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 194 [2024-11-10 14:33:30,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 176 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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:33:30,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:30,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 194 [2024-11-10 14:33:30,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:30,853 INFO L124 PetriNetUnfolderBase]: 579/2278 cut-off events. [2024-11-10 14:33:30,854 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:33:30,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3540 conditions, 2278 events. 579/2278 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 16136 event pairs, 343 based on Foata normal form. 0/2093 useless extension candidates. Maximal degree in co-relation 3502. Up to 1080 conditions per place. [2024-11-10 14:33:30,867 INFO L140 encePairwiseOnDemand]: 171/194 looper letters, 73 selfloop transitions, 70 changer transitions 0/269 dead transitions. [2024-11-10 14:33:30,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 269 transitions, 836 flow [2024-11-10 14:33:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:33:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:33:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 930 transitions. [2024-11-10 14:33:30,871 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7989690721649485 [2024-11-10 14:33:30,871 INFO L175 Difference]: Start difference. First operand has 181 places, 176 transitions, 364 flow. Second operand 6 states and 930 transitions. [2024-11-10 14:33:30,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 269 transitions, 836 flow [2024-11-10 14:33:30,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 269 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:30,881 INFO L231 Difference]: Finished difference. Result has 189 places, 245 transitions, 822 flow [2024-11-10 14:33:30,881 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=822, PETRI_PLACES=189, PETRI_TRANSITIONS=245} [2024-11-10 14:33:30,882 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 5 predicate places. [2024-11-10 14:33:30,882 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 245 transitions, 822 flow [2024-11-10 14:33:30,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 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:33:30,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:30,883 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:30,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:33:30,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:30,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1009001231, now seen corresponding path program 1 times [2024-11-10 14:33:30,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:30,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527069099] [2024-11-10 14:33:30,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:30,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:30,945 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:33:30,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:30,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527069099] [2024-11-10 14:33:30,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527069099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:30,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:30,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:33:30,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907774140] [2024-11-10 14:33:30,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:30,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:30,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:30,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:30,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:30,972 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 194 [2024-11-10 14:33:30,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 245 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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:33:30,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:30,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 194 [2024-11-10 14:33:30,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:31,115 INFO L124 PetriNetUnfolderBase]: 171/1219 cut-off events. [2024-11-10 14:33:31,115 INFO L125 PetriNetUnfolderBase]: For 119/136 co-relation queries the response was YES. [2024-11-10 14:33:31,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 1219 events. 171/1219 cut-off events. For 119/136 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7434 event pairs, 35 based on Foata normal form. 1/1134 useless extension candidates. Maximal degree in co-relation 1871. Up to 223 conditions per place. [2024-11-10 14:33:31,122 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 22 selfloop transitions, 3 changer transitions 0/251 dead transitions. [2024-11-10 14:33:31,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 251 transitions, 884 flow [2024-11-10 14:33:31,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2024-11-10 14:33:31,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8831615120274914 [2024-11-10 14:33:31,125 INFO L175 Difference]: Start difference. First operand has 189 places, 245 transitions, 822 flow. Second operand 3 states and 514 transitions. [2024-11-10 14:33:31,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 251 transitions, 884 flow [2024-11-10 14:33:31,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 251 transitions, 884 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:31,132 INFO L231 Difference]: Finished difference. Result has 192 places, 245 transitions, 833 flow [2024-11-10 14:33:31,133 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=833, PETRI_PLACES=192, PETRI_TRANSITIONS=245} [2024-11-10 14:33:31,133 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 8 predicate places. [2024-11-10 14:33:31,135 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 245 transitions, 833 flow [2024-11-10 14:33:31,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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:33:31,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:31,136 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:31,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:33:31,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:31,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:31,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1367289087, now seen corresponding path program 1 times [2024-11-10 14:33:31,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:31,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739161303] [2024-11-10 14:33:31,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:31,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:31,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:33:31,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:31,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739161303] [2024-11-10 14:33:31,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739161303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:31,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:31,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:31,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372115507] [2024-11-10 14:33:31,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:31,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:31,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:31,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:31,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:31,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2024-11-10 14:33:31,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 245 transitions, 833 flow. Second operand has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 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:33:31,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:31,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2024-11-10 14:33:31,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:31,316 INFO L124 PetriNetUnfolderBase]: 165/1044 cut-off events. [2024-11-10 14:33:31,317 INFO L125 PetriNetUnfolderBase]: For 94/99 co-relation queries the response was YES. [2024-11-10 14:33:31,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 1044 events. 165/1044 cut-off events. For 94/99 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6046 event pairs, 8 based on Foata normal form. 0/987 useless extension candidates. Maximal degree in co-relation 1732. Up to 253 conditions per place. [2024-11-10 14:33:31,324 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 20 selfloop transitions, 1 changer transitions 0/247 dead transitions. [2024-11-10 14:33:31,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 247 transitions, 879 flow [2024-11-10 14:33:31,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:31,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2024-11-10 14:33:31,327 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8745704467353952 [2024-11-10 14:33:31,327 INFO L175 Difference]: Start difference. First operand has 192 places, 245 transitions, 833 flow. Second operand 3 states and 509 transitions. [2024-11-10 14:33:31,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 247 transitions, 879 flow [2024-11-10 14:33:31,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 247 transitions, 873 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:31,334 INFO L231 Difference]: Finished difference. Result has 190 places, 243 transitions, 825 flow [2024-11-10 14:33:31,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=825, PETRI_PLACES=190, PETRI_TRANSITIONS=243} [2024-11-10 14:33:31,335 INFO L277 CegarLoopForPetriNet]: 184 programPoint places, 6 predicate places. [2024-11-10 14:33:31,336 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 243 transitions, 825 flow [2024-11-10 14:33:31,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 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:33:31,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:31,337 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, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:31,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:33:31,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-10 14:33:31,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1691698006, now seen corresponding path program 1 times [2024-11-10 14:33:31,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:31,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841965405] [2024-11-10 14:33:31,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:31,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:33:31,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:33:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:33:31,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:33:31,414 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:33:31,415 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2024-11-10 14:33:31,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2024-11-10 14:33:31,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2024-11-10 14:33:31,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2024-11-10 14:33:31,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2024-11-10 14:33:31,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2024-11-10 14:33:31,419 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2024-11-10 14:33:31,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2024-11-10 14:33:31,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2024-11-10 14:33:31,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2024-11-10 14:33:31,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2024-11-10 14:33:31,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2024-11-10 14:33:31,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2024-11-10 14:33:31,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2024-11-10 14:33:31,424 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2024-11-10 14:33:31,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2024-11-10 14:33:31,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2024-11-10 14:33:31,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2024-11-10 14:33:31,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2024-11-10 14:33:31,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2024-11-10 14:33:31,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:33:31,426 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:31,432 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:33:31,432 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:33:31,500 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:33:31,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 267 transitions, 550 flow [2024-11-10 14:33:31,549 INFO L124 PetriNetUnfolderBase]: 34/436 cut-off events. [2024-11-10 14:33:31,549 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:33:31,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 436 events. 34/436 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1670 event pairs, 0 based on Foata normal form. 0/370 useless extension candidates. Maximal degree in co-relation 266. Up to 8 conditions per place. [2024-11-10 14:33:31,554 INFO L82 GeneralOperation]: Start removeDead. Operand has 252 places, 267 transitions, 550 flow [2024-11-10 14:33:31,560 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 267 transitions, 550 flow [2024-11-10 14:33:31,562 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:33:31,563 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;@43040bd6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:33:31,563 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-10 14:33:31,565 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:33:31,566 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-11-10 14:33:31,566 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:33:31,566 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:31,566 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] [2024-11-10 14:33:31,566 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:33:31,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:31,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1674375052, now seen corresponding path program 1 times [2024-11-10 14:33:31,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:31,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72076829] [2024-11-10 14:33:31,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:31,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:31,591 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:33:31,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:31,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72076829] [2024-11-10 14:33:31,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72076829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:31,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:31,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:31,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950289775] [2024-11-10 14:33:31,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:31,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:31,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:31,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:31,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:31,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 267 [2024-11-10 14:33:31,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 267 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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:33:31,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:31,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 267 [2024-11-10 14:33:31,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:32,371 INFO L124 PetriNetUnfolderBase]: 610/5151 cut-off events. [2024-11-10 14:33:32,372 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-11-10 14:33:32,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6229 conditions, 5151 events. 610/5151 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 48434 event pairs, 600 based on Foata normal form. 962/5607 useless extension candidates. Maximal degree in co-relation 5267. Up to 1033 conditions per place. [2024-11-10 14:33:32,413 INFO L140 encePairwiseOnDemand]: 246/267 looper letters, 26 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2024-11-10 14:33:32,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 246 transitions, 564 flow [2024-11-10 14:33:32,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2024-11-10 14:33:32,417 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8789013732833958 [2024-11-10 14:33:32,417 INFO L175 Difference]: Start difference. First operand has 252 places, 267 transitions, 550 flow. Second operand 3 states and 704 transitions. [2024-11-10 14:33:32,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 246 transitions, 564 flow [2024-11-10 14:33:32,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 246 transitions, 564 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:32,424 INFO L231 Difference]: Finished difference. Result has 251 places, 246 transitions, 512 flow [2024-11-10 14:33:32,425 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=512, PETRI_PLACES=251, PETRI_TRANSITIONS=246} [2024-11-10 14:33:32,427 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, -1 predicate places. [2024-11-10 14:33:32,427 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 246 transitions, 512 flow [2024-11-10 14:33:32,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 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:33:32,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:32,429 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:32,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:33:32,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:33:32,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:32,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1538295604, now seen corresponding path program 1 times [2024-11-10 14:33:32,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:32,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841026731] [2024-11-10 14:33:32,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:32,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:32,464 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:33:32,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:32,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841026731] [2024-11-10 14:33:32,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841026731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:32,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:32,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:32,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515647762] [2024-11-10 14:33:32,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:32,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:32,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:32,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:32,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:32,478 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 267 [2024-11-10 14:33:32,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 246 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 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:33:32,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:32,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 267 [2024-11-10 14:33:32,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:33,177 INFO L124 PetriNetUnfolderBase]: 598/5083 cut-off events. [2024-11-10 14:33:33,179 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-11-10 14:33:33,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6142 conditions, 5083 events. 598/5083 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 47588 event pairs, 594 based on Foata normal form. 0/4598 useless extension candidates. Maximal degree in co-relation 6101. Up to 1011 conditions per place. [2024-11-10 14:33:33,223 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 24 selfloop transitions, 1 changer transitions 0/244 dead transitions. [2024-11-10 14:33:33,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 244 transitions, 558 flow [2024-11-10 14:33:33,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2024-11-10 14:33:33,229 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8614232209737828 [2024-11-10 14:33:33,229 INFO L175 Difference]: Start difference. First operand has 251 places, 246 transitions, 512 flow. Second operand 3 states and 690 transitions. [2024-11-10 14:33:33,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 244 transitions, 558 flow [2024-11-10 14:33:33,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 244 transitions, 554 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:33,234 INFO L231 Difference]: Finished difference. Result has 249 places, 244 transitions, 506 flow [2024-11-10 14:33:33,235 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=506, PETRI_PLACES=249, PETRI_TRANSITIONS=244} [2024-11-10 14:33:33,236 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, -3 predicate places. [2024-11-10 14:33:33,237 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 244 transitions, 506 flow [2024-11-10 14:33:33,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 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:33:33,238 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:33,238 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:33,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:33:33,238 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:33:33,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:33,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1946422640, now seen corresponding path program 1 times [2024-11-10 14:33:33,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:33,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194679234] [2024-11-10 14:33:33,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:33,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:33,264 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:33:33,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:33,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194679234] [2024-11-10 14:33:33,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194679234] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:33,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:33,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:33,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508401062] [2024-11-10 14:33:33,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:33,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:33,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:33,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:33,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:33,293 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 267 [2024-11-10 14:33:33,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 244 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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:33:33,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:33,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 267 [2024-11-10 14:33:33,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:34,114 INFO L124 PetriNetUnfolderBase]: 868/5634 cut-off events. [2024-11-10 14:33:34,114 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2024-11-10 14:33:34,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7134 conditions, 5634 events. 868/5634 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 54068 event pairs, 856 based on Foata normal form. 0/5094 useless extension candidates. Maximal degree in co-relation 7095. Up to 1443 conditions per place. [2024-11-10 14:33:34,159 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 28 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2024-11-10 14:33:34,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 243 transitions, 564 flow [2024-11-10 14:33:34,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:34,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2024-11-10 14:33:34,162 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8514357053682896 [2024-11-10 14:33:34,162 INFO L175 Difference]: Start difference. First operand has 249 places, 244 transitions, 506 flow. Second operand 3 states and 682 transitions. [2024-11-10 14:33:34,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 243 transitions, 564 flow [2024-11-10 14:33:34,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 243 transitions, 563 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:33:34,167 INFO L231 Difference]: Finished difference. Result has 249 places, 243 transitions, 507 flow [2024-11-10 14:33:34,167 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=507, PETRI_PLACES=249, PETRI_TRANSITIONS=243} [2024-11-10 14:33:34,169 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, -3 predicate places. [2024-11-10 14:33:34,169 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 243 transitions, 507 flow [2024-11-10 14:33:34,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 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:33:34,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:34,170 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:34,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:33:34,171 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:33:34,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1592937987, now seen corresponding path program 1 times [2024-11-10 14:33:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:34,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011982793] [2024-11-10 14:33:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:34,525 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:33:34,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:34,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011982793] [2024-11-10 14:33:34,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011982793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:34,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:34,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:33:34,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524149063] [2024-11-10 14:33:34,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:34,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:33:34,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:34,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:33:34,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:34,800 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 267 [2024-11-10 14:33:34,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 243 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 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:33:34,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:34,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 267 [2024-11-10 14:33:34,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:42,615 INFO L124 PetriNetUnfolderBase]: 29150/69983 cut-off events. [2024-11-10 14:33:42,616 INFO L125 PetriNetUnfolderBase]: For 714/714 co-relation queries the response was YES. [2024-11-10 14:33:42,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115521 conditions, 69983 events. 29150/69983 cut-off events. For 714/714 co-relation queries the response was YES. Maximal size of possible extension queue 1128. Compared 790470 event pairs, 19147 based on Foata normal form. 0/65415 useless extension candidates. Maximal degree in co-relation 115482. Up to 40547 conditions per place. [2024-11-10 14:33:43,085 INFO L140 encePairwiseOnDemand]: 228/267 looper letters, 122 selfloop transitions, 134 changer transitions 0/425 dead transitions. [2024-11-10 14:33:43,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 425 transitions, 1388 flow [2024-11-10 14:33:43,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:33:43,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:33:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1301 transitions. [2024-11-10 14:33:43,091 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8121098626716604 [2024-11-10 14:33:43,091 INFO L175 Difference]: Start difference. First operand has 249 places, 243 transitions, 507 flow. Second operand 6 states and 1301 transitions. [2024-11-10 14:33:43,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 425 transitions, 1388 flow [2024-11-10 14:33:43,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 425 transitions, 1384 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:33:43,106 INFO L231 Difference]: Finished difference. Result has 257 places, 376 transitions, 1381 flow [2024-11-10 14:33:43,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1381, PETRI_PLACES=257, PETRI_TRANSITIONS=376} [2024-11-10 14:33:43,107 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, 5 predicate places. [2024-11-10 14:33:43,107 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 376 transitions, 1381 flow [2024-11-10 14:33:43,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 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:33:43,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:43,108 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:43,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:33:43,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:33:43,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:43,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1441138820, now seen corresponding path program 1 times [2024-11-10 14:33:43,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:43,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281665020] [2024-11-10 14:33:43,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:43,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:43,156 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:33:43,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:43,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281665020] [2024-11-10 14:33:43,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281665020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:43,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:43,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:33:43,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404505837] [2024-11-10 14:33:43,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:43,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:43,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:43,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:43,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:43,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 267 [2024-11-10 14:33:43,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 376 transitions, 1381 flow. Second operand has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 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:33:43,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:43,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 267 [2024-11-10 14:33:43,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:46,760 INFO L124 PetriNetUnfolderBase]: 9909/32935 cut-off events. [2024-11-10 14:33:46,760 INFO L125 PetriNetUnfolderBase]: For 4659/5158 co-relation queries the response was YES. [2024-11-10 14:33:46,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58047 conditions, 32935 events. 9909/32935 cut-off events. For 4659/5158 co-relation queries the response was YES. Maximal size of possible extension queue 642. Compared 384652 event pairs, 5139 based on Foata normal form. 1/30387 useless extension candidates. Maximal degree in co-relation 58004. Up to 12346 conditions per place. [2024-11-10 14:33:47,001 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 32 selfloop transitions, 3 changer transitions 0/384 dead transitions. [2024-11-10 14:33:47,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 384 transitions, 1473 flow [2024-11-10 14:33:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:47,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2024-11-10 14:33:47,004 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8739076154806492 [2024-11-10 14:33:47,004 INFO L175 Difference]: Start difference. First operand has 257 places, 376 transitions, 1381 flow. Second operand 3 states and 700 transitions. [2024-11-10 14:33:47,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 384 transitions, 1473 flow [2024-11-10 14:33:47,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 384 transitions, 1473 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:33:47,081 INFO L231 Difference]: Finished difference. Result has 260 places, 378 transitions, 1406 flow [2024-11-10 14:33:47,082 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1406, PETRI_PLACES=260, PETRI_TRANSITIONS=378} [2024-11-10 14:33:47,083 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, 8 predicate places. [2024-11-10 14:33:47,083 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 378 transitions, 1406 flow [2024-11-10 14:33:47,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 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:33:47,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:47,084 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:47,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:33:47,085 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:33:47,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:47,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1128186056, now seen corresponding path program 1 times [2024-11-10 14:33:47,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:47,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947780059] [2024-11-10 14:33:47,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:47,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:47,124 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:33:47,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:47,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947780059] [2024-11-10 14:33:47,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947780059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:47,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:47,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:33:47,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634242728] [2024-11-10 14:33:47,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:47,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:33:47,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:47,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:33:47,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:33:47,141 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 215 out of 267 [2024-11-10 14:33:47,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 378 transitions, 1406 flow. Second operand has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:33:47,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:47,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 215 of 267 [2024-11-10 14:33:47,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:33:50,807 INFO L124 PetriNetUnfolderBase]: 10188/34479 cut-off events. [2024-11-10 14:33:50,807 INFO L125 PetriNetUnfolderBase]: For 4921/5401 co-relation queries the response was YES. [2024-11-10 14:33:50,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62138 conditions, 34479 events. 10188/34479 cut-off events. For 4921/5401 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 405990 event pairs, 4069 based on Foata normal form. 0/32501 useless extension candidates. Maximal degree in co-relation 62094. Up to 12347 conditions per place. [2024-11-10 14:33:50,998 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 38 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2024-11-10 14:33:50,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 385 transitions, 1505 flow [2024-11-10 14:33:50,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:33:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:33:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2024-11-10 14:33:51,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8601747815230961 [2024-11-10 14:33:51,001 INFO L175 Difference]: Start difference. First operand has 260 places, 378 transitions, 1406 flow. Second operand 3 states and 689 transitions. [2024-11-10 14:33:51,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 385 transitions, 1505 flow [2024-11-10 14:33:51,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 385 transitions, 1502 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:33:51,111 INFO L231 Difference]: Finished difference. Result has 258 places, 376 transitions, 1409 flow [2024-11-10 14:33:51,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1395, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1409, PETRI_PLACES=258, PETRI_TRANSITIONS=376} [2024-11-10 14:33:51,112 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, 6 predicate places. [2024-11-10 14:33:51,112 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 376 transitions, 1409 flow [2024-11-10 14:33:51,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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:33:51,113 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:33:51,113 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:33:51,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:33:51,115 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:33:51,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:33:51,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1644922719, now seen corresponding path program 1 times [2024-11-10 14:33:51,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:33:51,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807186640] [2024-11-10 14:33:51,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:33:51,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:33:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:33:51,405 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:33:51,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:33:51,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807186640] [2024-11-10 14:33:51,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807186640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:33:51,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:33:51,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:33:51,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406835557] [2024-11-10 14:33:51,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:33:51,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:33:51,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:33:51,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:33:51,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:33:51,719 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 267 [2024-11-10 14:33:51,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 376 transitions, 1409 flow. Second operand has 6 states, 6 states have (on average 180.33333333333334) internal successors, (1082), 6 states have internal predecessors, (1082), 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:33:51,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:33:51,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 267 [2024-11-10 14:33:51,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:34:02,324 INFO L124 PetriNetUnfolderBase]: 39054/90104 cut-off events. [2024-11-10 14:34:02,324 INFO L125 PetriNetUnfolderBase]: For 32750/36556 co-relation queries the response was YES. [2024-11-10 14:34:02,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204587 conditions, 90104 events. 39054/90104 cut-off events. For 32750/36556 co-relation queries the response was YES. Maximal size of possible extension queue 1975. Compared 1047036 event pairs, 9985 based on Foata normal form. 47/86242 useless extension candidates. Maximal degree in co-relation 204542. Up to 36092 conditions per place. [2024-11-10 14:34:03,074 INFO L140 encePairwiseOnDemand]: 219/267 looper letters, 473 selfloop transitions, 219 changer transitions 0/867 dead transitions. [2024-11-10 14:34:03,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 867 transitions, 5023 flow [2024-11-10 14:34:03,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:34:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:34:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1406 transitions. [2024-11-10 14:34:03,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776529338327091 [2024-11-10 14:34:03,078 INFO L175 Difference]: Start difference. First operand has 258 places, 376 transitions, 1409 flow. Second operand 6 states and 1406 transitions. [2024-11-10 14:34:03,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 867 transitions, 5023 flow [2024-11-10 14:34:03,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 867 transitions, 5023 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:34:03,423 INFO L231 Difference]: Finished difference. Result has 268 places, 607 transitions, 3725 flow [2024-11-10 14:34:03,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1409, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3725, PETRI_PLACES=268, PETRI_TRANSITIONS=607} [2024-11-10 14:34:03,424 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, 16 predicate places. [2024-11-10 14:34:03,424 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 607 transitions, 3725 flow [2024-11-10 14:34:03,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.33333333333334) internal successors, (1082), 6 states have internal predecessors, (1082), 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:34:03,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:34:03,425 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:34:03,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:34:03,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:34:03,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:34:03,426 INFO L85 PathProgramCache]: Analyzing trace with hash 851260392, now seen corresponding path program 1 times [2024-11-10 14:34:03,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:34:03,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917367147] [2024-11-10 14:34:03,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:34:03,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:34:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:34:03,514 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:34:03,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:34:03,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917367147] [2024-11-10 14:34:03,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917367147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 14:34:03,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158709147] [2024-11-10 14:34:03,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:34:03,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 14:34:03,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:34:03,518 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:34:03,520 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:34:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:34:03,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:34:03,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:34:03,723 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:34:03,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:34:03,794 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:34:03,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158709147] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:34:03,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 14:34:03,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-10 14:34:03,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895459336] [2024-11-10 14:34:03,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 14:34:03,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 14:34:03,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:34:03,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 14:34:03,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-10 14:34:03,867 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 267 [2024-11-10 14:34:03,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 607 transitions, 3725 flow. Second operand has 10 states, 10 states have (on average 221.3) internal successors, (2213), 10 states have internal predecessors, (2213), 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:34:03,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:34:03,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 267 [2024-11-10 14:34:03,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:34:10,713 INFO L124 PetriNetUnfolderBase]: 21583/56141 cut-off events. [2024-11-10 14:34:10,713 INFO L125 PetriNetUnfolderBase]: For 52108/56168 co-relation queries the response was YES. [2024-11-10 14:34:10,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151902 conditions, 56141 events. 21583/56141 cut-off events. For 52108/56168 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 623927 event pairs, 2542 based on Foata normal form. 596/55343 useless extension candidates. Maximal degree in co-relation 151852. Up to 19836 conditions per place. [2024-11-10 14:34:11,207 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 72 selfloop transitions, 9 changer transitions 0/611 dead transitions. [2024-11-10 14:34:11,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 611 transitions, 3887 flow [2024-11-10 14:34:11,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 14:34:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 14:34:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2052 transitions. [2024-11-10 14:34:11,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8539325842696629 [2024-11-10 14:34:11,213 INFO L175 Difference]: Start difference. First operand has 268 places, 607 transitions, 3725 flow. Second operand 9 states and 2052 transitions. [2024-11-10 14:34:11,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 611 transitions, 3887 flow [2024-11-10 14:34:12,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 611 transitions, 3869 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-11-10 14:34:12,007 INFO L231 Difference]: Finished difference. Result has 224 places, 555 transitions, 3613 flow [2024-11-10 14:34:12,008 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=3591, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3613, PETRI_PLACES=224, PETRI_TRANSITIONS=555} [2024-11-10 14:34:12,009 INFO L277 CegarLoopForPetriNet]: 252 programPoint places, -28 predicate places. [2024-11-10 14:34:12,009 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 555 transitions, 3613 flow [2024-11-10 14:34:12,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 221.3) internal successors, (2213), 10 states have internal predecessors, (2213), 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:34:12,010 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:34:12,010 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:34:12,031 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:34:12,211 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,SelfDestructingSolverStorable14 [2024-11-10 14:34:12,211 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:34:12,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:34:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1238244232, now seen corresponding path program 1 times [2024-11-10 14:34:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:34:12,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829877493] [2024-11-10 14:34:12,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:34:12,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:34:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:34:12,669 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:34:12,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:34:12,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829877493] [2024-11-10 14:34:12,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829877493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:34:12,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:34:12,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:34:12,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446453954] [2024-11-10 14:34:12,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:34:12,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:34:12,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:34:12,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:34:12,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:34:12,959 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 267 [2024-11-10 14:34:12,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 555 transitions, 3613 flow. Second operand has 6 states, 6 states have (on average 174.33333333333334) internal successors, (1046), 6 states have internal predecessors, (1046), 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:34:12,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:34:12,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 267 [2024-11-10 14:34:12,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand