./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d 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_19-callback_racing.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 a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:55:11,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:55:11,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:55:11,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:55:11,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:55:11,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:55:11,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:55:11,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:55:11,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:55:11,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:55:11,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:55:11,865 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:55:11,865 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:55:11,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:55:11,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:55:11,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:55:11,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:55:11,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:55:11,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:55:11,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:55:11,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:55:11,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:55:11,869 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:55:11,869 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:55:11,870 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:55:11,870 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:55:11,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:55:11,870 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:55:11,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:55:11,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:55:11,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:55:11,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:55:11,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:55:11,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:55:11,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:55:11,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:55:11,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:55:11,873 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:55:11,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:55:11,874 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:55:11,874 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:55:11,874 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 -> a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 [2024-11-09 06:55:12,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:55:12,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:55:12,145 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:55:12,146 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:55:12,151 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:55:12,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2024-11-09 06:55:13,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:55:14,037 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:55:14,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2024-11-09 06:55:14,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73197ac52/70dd5ed529fe4c7d802f59ccc06e1715/FLAGeda0268dc [2024-11-09 06:55:14,393 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73197ac52/70dd5ed529fe4c7d802f59ccc06e1715 [2024-11-09 06:55:14,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:55:14,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:55:14,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:55:14,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:55:14,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:55:14,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:55:14" (1/1) ... [2024-11-09 06:55:14,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55ffe0bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:14, skipping insertion in model container [2024-11-09 06:55:14,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:55:14" (1/1) ... [2024-11-09 06:55:14,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:55:14,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:55:14,769 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:55:14,826 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:55:14,862 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:55:14,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:14 WrapperNode [2024-11-09 06:55:14,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:55:14,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:55:14,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:55:14,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:55:14,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:14" (1/1) ... [2024-11-09 06:55:14,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:14" (1/1) ... [2024-11-09 06:55:14,969 INFO L138 Inliner]: procedures = 174, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 174 [2024-11-09 06:55:14,969 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:55:14,970 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:55:14,970 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:55:14,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:55:15,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:14" (1/1) ... [2024-11-09 06:55:15,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:14" (1/1) ... [2024-11-09 06:55:15,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:14" (1/1) ... [2024-11-09 06:55:15,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:14" (1/1) ... [2024-11-09 06:55:15,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:14" (1/1) ... [2024-11-09 06:55:15,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:14" (1/1) ... [2024-11-09 06:55:15,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:14" (1/1) ... [2024-11-09 06:55:15,030 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:14" (1/1) ... [2024-11-09 06:55:15,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:55:15,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:55:15,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:55:15,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:55:15,033 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:14" (1/1) ... [2024-11-09 06:55:15,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:55:15,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:55:15,061 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-09 06:55:15,063 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-09 06:55:15,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:55:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:55:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 06:55:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:55:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:55:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 06:55:15,096 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 06:55:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:55:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:55:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 06:55:15,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:55:15,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:55:15,098 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:55:15,211 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:55:15,213 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:55:15,478 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:55:15,479 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:55:15,505 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:55:15,506 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-09 06:55:15,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:55:15 BoogieIcfgContainer [2024-11-09 06:55:15,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:55:15,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:55:15,508 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:55:15,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:55:15,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:55:14" (1/3) ... [2024-11-09 06:55:15,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d78ad12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:55:15, skipping insertion in model container [2024-11-09 06:55:15,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:55:14" (2/3) ... [2024-11-09 06:55:15,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d78ad12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:55:15, skipping insertion in model container [2024-11-09 06:55:15,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:55:15" (3/3) ... [2024-11-09 06:55:15,513 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_19-callback_racing.i [2024-11-09 06:55:15,528 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:55:15,528 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-09 06:55:15,528 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:55:15,583 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 06:55:15,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 181 transitions, 369 flow [2024-11-09 06:55:15,737 INFO L124 PetriNetUnfolderBase]: 27/291 cut-off events. [2024-11-09 06:55:15,738 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:55:15,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 291 events. 27/291 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 962 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 143. Up to 6 conditions per place. [2024-11-09 06:55:15,746 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 181 transitions, 369 flow [2024-11-09 06:55:15,754 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 181 transitions, 369 flow [2024-11-09 06:55:15,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:55:15,773 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;@101114d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:55:15,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-09 06:55:15,788 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:55:15,789 INFO L124 PetriNetUnfolderBase]: 2/55 cut-off events. [2024-11-09 06:55:15,789 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:55:15,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:15,790 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] [2024-11-09 06:55:15,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:55:15,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:15,798 INFO L85 PathProgramCache]: Analyzing trace with hash -274697999, now seen corresponding path program 1 times [2024-11-09 06:55:15,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:15,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815130255] [2024-11-09 06:55:15,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:15,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:16,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:16,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:16,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815130255] [2024-11-09 06:55:16,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815130255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:16,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:16,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:55:16,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271267048] [2024-11-09 06:55:16,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:16,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:55:16,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:16,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:55:16,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:55:16,983 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 181 [2024-11-09 06:55:17,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 181 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 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-09 06:55:17,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:17,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 181 [2024-11-09 06:55:17,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:17,249 INFO L124 PetriNetUnfolderBase]: 93/755 cut-off events. [2024-11-09 06:55:17,251 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 06:55:17,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 755 events. 93/755 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4186 event pairs, 33 based on Foata normal form. 101/800 useless extension candidates. Maximal degree in co-relation 798. Up to 154 conditions per place. [2024-11-09 06:55:17,263 INFO L140 encePairwiseOnDemand]: 162/181 looper letters, 40 selfloop transitions, 5 changer transitions 0/181 dead transitions. [2024-11-09 06:55:17,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 181 transitions, 459 flow [2024-11-09 06:55:17,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:55:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:55:17,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 897 transitions. [2024-11-09 06:55:17,288 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8259668508287292 [2024-11-09 06:55:17,294 INFO L175 Difference]: Start difference. First operand has 168 places, 181 transitions, 369 flow. Second operand 6 states and 897 transitions. [2024-11-09 06:55:17,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 181 transitions, 459 flow [2024-11-09 06:55:17,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 181 transitions, 459 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:55:17,306 INFO L231 Difference]: Finished difference. Result has 170 places, 165 transitions, 347 flow [2024-11-09 06:55:17,308 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=170, PETRI_TRANSITIONS=165} [2024-11-09 06:55:17,315 INFO L277 CegarLoopForPetriNet]: 168 programPoint places, 2 predicate places. [2024-11-09 06:55:17,315 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 165 transitions, 347 flow [2024-11-09 06:55:17,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 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-09 06:55:17,316 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:17,317 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] [2024-11-09 06:55:17,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:55:17,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:55:17,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:17,318 INFO L85 PathProgramCache]: Analyzing trace with hash -311166184, now seen corresponding path program 1 times [2024-11-09 06:55:17,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:17,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396079138] [2024-11-09 06:55:17,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:17,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:17,386 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-09 06:55:17,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:17,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396079138] [2024-11-09 06:55:17,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396079138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:17,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:17,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:17,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753529421] [2024-11-09 06:55:17,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:17,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:17,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:17,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:17,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:17,418 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 181 [2024-11-09 06:55:17,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 165 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:17,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:17,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 181 [2024-11-09 06:55:17,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:17,616 INFO L124 PetriNetUnfolderBase]: 113/926 cut-off events. [2024-11-09 06:55:17,616 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2024-11-09 06:55:17,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 926 events. 113/926 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4855 event pairs, 34 based on Foata normal form. 1/849 useless extension candidates. Maximal degree in co-relation 1029. Up to 137 conditions per place. [2024-11-09 06:55:17,623 INFO L140 encePairwiseOnDemand]: 172/181 looper letters, 30 selfloop transitions, 6 changer transitions 0/178 dead transitions. [2024-11-09 06:55:17,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 178 transitions, 448 flow [2024-11-09 06:55:17,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:17,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2024-11-09 06:55:17,626 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8674033149171271 [2024-11-09 06:55:17,626 INFO L175 Difference]: Start difference. First operand has 170 places, 165 transitions, 347 flow. Second operand 3 states and 471 transitions. [2024-11-09 06:55:17,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 178 transitions, 448 flow [2024-11-09 06:55:17,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 178 transitions, 438 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:55:17,635 INFO L231 Difference]: Finished difference. Result has 167 places, 167 transitions, 375 flow [2024-11-09 06:55:17,635 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=375, PETRI_PLACES=167, PETRI_TRANSITIONS=167} [2024-11-09 06:55:17,636 INFO L277 CegarLoopForPetriNet]: 168 programPoint places, -1 predicate places. [2024-11-09 06:55:17,637 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 167 transitions, 375 flow [2024-11-09 06:55:17,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:17,638 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:17,638 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] [2024-11-09 06:55:17,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:55:17,639 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:55:17,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:17,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2001203335, now seen corresponding path program 1 times [2024-11-09 06:55:17,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:17,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208962122] [2024-11-09 06:55:17,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:17,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:17,711 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-09 06:55:17,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:17,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208962122] [2024-11-09 06:55:17,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208962122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:17,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:17,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:55:17,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020898240] [2024-11-09 06:55:17,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:17,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:17,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:17,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:17,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:17,750 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 181 [2024-11-09 06:55:17,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 167 transitions, 375 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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-09 06:55:17,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:17,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 181 [2024-11-09 06:55:17,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:17,891 INFO L124 PetriNetUnfolderBase]: 82/908 cut-off events. [2024-11-09 06:55:17,891 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2024-11-09 06:55:17,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 908 events. 82/908 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4757 event pairs, 38 based on Foata normal form. 1/843 useless extension candidates. Maximal degree in co-relation 1041. Up to 146 conditions per place. [2024-11-09 06:55:17,900 INFO L140 encePairwiseOnDemand]: 178/181 looper letters, 20 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2024-11-09 06:55:17,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 171 transitions, 427 flow [2024-11-09 06:55:17,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2024-11-09 06:55:17,902 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8655616942909761 [2024-11-09 06:55:17,902 INFO L175 Difference]: Start difference. First operand has 167 places, 167 transitions, 375 flow. Second operand 3 states and 470 transitions. [2024-11-09 06:55:17,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 171 transitions, 427 flow [2024-11-09 06:55:17,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 171 transitions, 415 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:55:17,911 INFO L231 Difference]: Finished difference. Result has 168 places, 167 transitions, 371 flow [2024-11-09 06:55:17,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=168, PETRI_TRANSITIONS=167} [2024-11-09 06:55:17,913 INFO L277 CegarLoopForPetriNet]: 168 programPoint places, 0 predicate places. [2024-11-09 06:55:17,914 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 167 transitions, 371 flow [2024-11-09 06:55:17,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 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-09 06:55:17,915 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:17,915 INFO L204 CegarLoopForPetriNet]: trace histogram [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] [2024-11-09 06:55:17,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:55:17,916 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2024-11-09 06:55:17,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:17,918 INFO L85 PathProgramCache]: Analyzing trace with hash -964947795, now seen corresponding path program 1 times [2024-11-09 06:55:17,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:17,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912441497] [2024-11-09 06:55:17,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:17,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:17,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:55:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:18,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:55:18,018 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:55:18,019 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2024-11-09 06:55:18,021 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2024-11-09 06:55:18,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2024-11-09 06:55:18,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2024-11-09 06:55:18,022 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2024-11-09 06:55:18,023 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2024-11-09 06:55:18,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2024-11-09 06:55:18,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2024-11-09 06:55:18,025 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2024-11-09 06:55:18,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:55:18,026 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 06:55:18,029 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 06:55:18,029 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 06:55:18,065 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 06:55:18,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 213 transitions, 442 flow [2024-11-09 06:55:18,127 INFO L124 PetriNetUnfolderBase]: 45/461 cut-off events. [2024-11-09 06:55:18,127 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 06:55:18,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 461 events. 45/461 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1835 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 293. Up to 9 conditions per place. [2024-11-09 06:55:18,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 213 transitions, 442 flow [2024-11-09 06:55:18,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 213 transitions, 442 flow [2024-11-09 06:55:18,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:55:18,138 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;@101114d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:55:18,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-09 06:55:18,144 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:55:18,144 INFO L124 PetriNetUnfolderBase]: 2/55 cut-off events. [2024-11-09 06:55:18,144 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:55:18,144 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:18,144 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] [2024-11-09 06:55:18,144 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-09 06:55:18,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:18,145 INFO L85 PathProgramCache]: Analyzing trace with hash 834523153, now seen corresponding path program 1 times [2024-11-09 06:55:18,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:18,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821607245] [2024-11-09 06:55:18,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:18,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:18,501 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-09 06:55:18,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:18,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821607245] [2024-11-09 06:55:18,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821607245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:18,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:18,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:55:18,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612567718] [2024-11-09 06:55:18,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:18,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:55:18,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:18,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:55:18,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:55:18,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 213 [2024-11-09 06:55:18,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 213 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 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-09 06:55:18,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:18,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 213 [2024-11-09 06:55:18,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:19,355 INFO L124 PetriNetUnfolderBase]: 1001/4600 cut-off events. [2024-11-09 06:55:19,355 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-09 06:55:19,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6259 conditions, 4600 events. 1001/4600 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 43093 event pairs, 108 based on Foata normal form. 915/5182 useless extension candidates. Maximal degree in co-relation 1068. Up to 1202 conditions per place. [2024-11-09 06:55:19,390 INFO L140 encePairwiseOnDemand]: 190/213 looper letters, 62 selfloop transitions, 5 changer transitions 0/223 dead transitions. [2024-11-09 06:55:19,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 223 transitions, 596 flow [2024-11-09 06:55:19,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:55:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:55:19,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1065 transitions. [2024-11-09 06:55:19,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2024-11-09 06:55:19,395 INFO L175 Difference]: Start difference. First operand has 197 places, 213 transitions, 442 flow. Second operand 6 states and 1065 transitions. [2024-11-09 06:55:19,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 223 transitions, 596 flow [2024-11-09 06:55:19,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 223 transitions, 596 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:55:19,399 INFO L231 Difference]: Finished difference. Result has 197 places, 191 transitions, 408 flow [2024-11-09 06:55:19,399 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=197, PETRI_TRANSITIONS=191} [2024-11-09 06:55:19,400 INFO L277 CegarLoopForPetriNet]: 197 programPoint places, 0 predicate places. [2024-11-09 06:55:19,400 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 191 transitions, 408 flow [2024-11-09 06:55:19,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 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-09 06:55:19,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:19,401 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] [2024-11-09 06:55:19,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:55:19,402 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-09 06:55:19,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:19,402 INFO L85 PathProgramCache]: Analyzing trace with hash -969738534, now seen corresponding path program 1 times [2024-11-09 06:55:19,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:19,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198792241] [2024-11-09 06:55:19,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:19,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:19,466 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-09 06:55:19,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:19,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198792241] [2024-11-09 06:55:19,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198792241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:19,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:19,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:19,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648052668] [2024-11-09 06:55:19,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:19,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:19,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:19,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:19,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:19,492 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 213 [2024-11-09 06:55:19,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 191 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-09 06:55:19,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:19,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 213 [2024-11-09 06:55:19,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:20,468 INFO L124 PetriNetUnfolderBase]: 2104/8794 cut-off events. [2024-11-09 06:55:20,468 INFO L125 PetriNetUnfolderBase]: For 261/449 co-relation queries the response was YES. [2024-11-09 06:55:20,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12323 conditions, 8794 events. 2104/8794 cut-off events. For 261/449 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 87246 event pairs, 758 based on Foata normal form. 7/7967 useless extension candidates. Maximal degree in co-relation 10535. Up to 2127 conditions per place. [2024-11-09 06:55:20,515 INFO L140 encePairwiseOnDemand]: 201/213 looper letters, 45 selfloop transitions, 8 changer transitions 0/212 dead transitions. [2024-11-09 06:55:20,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 212 transitions, 567 flow [2024-11-09 06:55:20,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2024-11-09 06:55:20,517 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8497652582159625 [2024-11-09 06:55:20,518 INFO L175 Difference]: Start difference. First operand has 197 places, 191 transitions, 408 flow. Second operand 3 states and 543 transitions. [2024-11-09 06:55:20,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 212 transitions, 567 flow [2024-11-09 06:55:20,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 212 transitions, 557 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:55:20,522 INFO L231 Difference]: Finished difference. Result has 194 places, 195 transitions, 454 flow [2024-11-09 06:55:20,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=194, PETRI_TRANSITIONS=195} [2024-11-09 06:55:20,523 INFO L277 CegarLoopForPetriNet]: 197 programPoint places, -3 predicate places. [2024-11-09 06:55:20,523 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 195 transitions, 454 flow [2024-11-09 06:55:20,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-09 06:55:20,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:20,524 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] [2024-11-09 06:55:20,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:55:20,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-09 06:55:20,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash 597928487, now seen corresponding path program 1 times [2024-11-09 06:55:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:20,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115859796] [2024-11-09 06:55:20,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:20,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:20,552 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-09 06:55:20,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:20,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115859796] [2024-11-09 06:55:20,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115859796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:20,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:20,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:55:20,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820515233] [2024-11-09 06:55:20,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:20,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:20,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:20,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:20,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:20,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 213 [2024-11-09 06:55:20,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 195 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:20,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:20,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 213 [2024-11-09 06:55:20,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:21,247 INFO L124 PetriNetUnfolderBase]: 1362/7534 cut-off events. [2024-11-09 06:55:21,247 INFO L125 PetriNetUnfolderBase]: For 419/500 co-relation queries the response was YES. [2024-11-09 06:55:21,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10348 conditions, 7534 events. 1362/7534 cut-off events. For 419/500 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 76545 event pairs, 874 based on Foata normal form. 1/6886 useless extension candidates. Maximal degree in co-relation 6779. Up to 1911 conditions per place. [2024-11-09 06:55:21,286 INFO L140 encePairwiseOnDemand]: 210/213 looper letters, 27 selfloop transitions, 2 changer transitions 0/200 dead transitions. [2024-11-09 06:55:21,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 200 transitions, 522 flow [2024-11-09 06:55:21,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2024-11-09 06:55:21,288 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8450704225352113 [2024-11-09 06:55:21,288 INFO L175 Difference]: Start difference. First operand has 194 places, 195 transitions, 454 flow. Second operand 3 states and 540 transitions. [2024-11-09 06:55:21,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 200 transitions, 522 flow [2024-11-09 06:55:21,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 200 transitions, 506 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:55:21,293 INFO L231 Difference]: Finished difference. Result has 195 places, 196 transitions, 450 flow [2024-11-09 06:55:21,294 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=438, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=195, PETRI_TRANSITIONS=196} [2024-11-09 06:55:21,294 INFO L277 CegarLoopForPetriNet]: 197 programPoint places, -2 predicate places. [2024-11-09 06:55:21,294 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 196 transitions, 450 flow [2024-11-09 06:55:21,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:55:21,295 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:21,295 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:21,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:55:21,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-09 06:55:21,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:21,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1915331391, now seen corresponding path program 1 times [2024-11-09 06:55:21,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:21,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122710265] [2024-11-09 06:55:21,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:21,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:21,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:21,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122710265] [2024-11-09 06:55:21,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122710265] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:55:21,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385765018] [2024-11-09 06:55:21,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:21,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:55:21,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:55:21,364 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-09 06:55:21,368 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-09 06:55:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:21,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 06:55:21,446 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:55:21,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:55:21,459 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:55:21,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385765018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:21,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:55:21,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 06:55:21,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091865543] [2024-11-09 06:55:21,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:21,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:21,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:21,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:21,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:55:21,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 213 [2024-11-09 06:55:21,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 196 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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-09 06:55:21,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:21,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 213 [2024-11-09 06:55:21,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:23,123 INFO L124 PetriNetUnfolderBase]: 2343/13191 cut-off events. [2024-11-09 06:55:23,124 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-11-09 06:55:23,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17693 conditions, 13191 events. 2343/13191 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 154880 event pairs, 1363 based on Foata normal form. 36/12104 useless extension candidates. Maximal degree in co-relation 17635. Up to 2189 conditions per place. [2024-11-09 06:55:23,266 INFO L140 encePairwiseOnDemand]: 210/213 looper letters, 37 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-11-09 06:55:23,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 211 transitions, 558 flow [2024-11-09 06:55:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2024-11-09 06:55:23,270 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8607198748043818 [2024-11-09 06:55:23,271 INFO L175 Difference]: Start difference. First operand has 195 places, 196 transitions, 450 flow. Second operand 3 states and 550 transitions. [2024-11-09 06:55:23,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 211 transitions, 558 flow [2024-11-09 06:55:23,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 211 transitions, 556 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:55:23,278 INFO L231 Difference]: Finished difference. Result has 197 places, 197 transitions, 460 flow [2024-11-09 06:55:23,279 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=197, PETRI_TRANSITIONS=197} [2024-11-09 06:55:23,280 INFO L277 CegarLoopForPetriNet]: 197 programPoint places, 0 predicate places. [2024-11-09 06:55:23,280 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 197 transitions, 460 flow [2024-11-09 06:55:23,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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-09 06:55:23,281 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:23,281 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-09 06:55:23,303 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-09 06:55:23,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:55:23,486 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2024-11-09 06:55:23,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:23,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1193848283, now seen corresponding path program 1 times [2024-11-09 06:55:23,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:23,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305999832] [2024-11-09 06:55:23,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:23,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:23,511 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:55:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:55:23,538 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:55:23,539 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:55:23,539 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2024-11-09 06:55:23,539 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2024-11-09 06:55:23,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2024-11-09 06:55:23,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2024-11-09 06:55:23,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2024-11-09 06:55:23,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2024-11-09 06:55:23,540 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2024-11-09 06:55:23,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2024-11-09 06:55:23,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2024-11-09 06:55:23,541 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2024-11-09 06:55:23,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:55:23,541 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 06:55:23,542 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 06:55:23,543 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 06:55:23,571 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 06:55:23,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 245 transitions, 517 flow [2024-11-09 06:55:23,647 INFO L124 PetriNetUnfolderBase]: 68/676 cut-off events. [2024-11-09 06:55:23,648 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-09 06:55:23,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 676 events. 68/676 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2933 event pairs, 1 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 469. Up to 16 conditions per place. [2024-11-09 06:55:23,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 245 transitions, 517 flow [2024-11-09 06:55:23,659 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 245 transitions, 517 flow [2024-11-09 06:55:23,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:55:23,660 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;@101114d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:55:23,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-09 06:55:23,665 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:55:23,665 INFO L124 PetriNetUnfolderBase]: 2/55 cut-off events. [2024-11-09 06:55:23,665 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:55:23,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:23,665 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:23,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 06:55:23,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:23,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1398176975, now seen corresponding path program 1 times [2024-11-09 06:55:23,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:23,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782105649] [2024-11-09 06:55:23,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:23,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:23,906 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-09 06:55:23,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:23,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782105649] [2024-11-09 06:55:23,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782105649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:23,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:23,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:55:23,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118229472] [2024-11-09 06:55:23,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:23,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:55:23,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:23,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:55:23,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:55:24,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 245 [2024-11-09 06:55:24,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 245 transitions, 517 flow. Second operand has 6 states, 6 states have (on average 180.5) internal successors, (1083), 6 states have internal predecessors, (1083), 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-09 06:55:24,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:24,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 245 [2024-11-09 06:55:24,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:26,651 INFO L124 PetriNetUnfolderBase]: 8120/26912 cut-off events. [2024-11-09 06:55:26,651 INFO L125 PetriNetUnfolderBase]: For 557/557 co-relation queries the response was YES. [2024-11-09 06:55:26,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38647 conditions, 26912 events. 8120/26912 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 324086 event pairs, 1746 based on Foata normal form. 6819/31993 useless extension candidates. Maximal degree in co-relation 6247. Up to 8631 conditions per place. [2024-11-09 06:55:26,820 INFO L140 encePairwiseOnDemand]: 218/245 looper letters, 84 selfloop transitions, 5 changer transitions 0/265 dead transitions. [2024-11-09 06:55:26,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 265 transitions, 735 flow [2024-11-09 06:55:26,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:55:26,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:55:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1233 transitions. [2024-11-09 06:55:26,826 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8387755102040816 [2024-11-09 06:55:26,826 INFO L175 Difference]: Start difference. First operand has 226 places, 245 transitions, 517 flow. Second operand 6 states and 1233 transitions. [2024-11-09 06:55:26,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 265 transitions, 735 flow [2024-11-09 06:55:26,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 265 transitions, 735 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:55:26,830 INFO L231 Difference]: Finished difference. Result has 224 places, 217 transitions, 471 flow [2024-11-09 06:55:26,831 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=471, PETRI_PLACES=224, PETRI_TRANSITIONS=217} [2024-11-09 06:55:26,832 INFO L277 CegarLoopForPetriNet]: 226 programPoint places, -2 predicate places. [2024-11-09 06:55:26,833 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 217 transitions, 471 flow [2024-11-09 06:55:26,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.5) internal successors, (1083), 6 states have internal predecessors, (1083), 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-09 06:55:26,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:26,834 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] [2024-11-09 06:55:26,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:55:26,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 06:55:26,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:26,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1061728344, now seen corresponding path program 1 times [2024-11-09 06:55:26,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:26,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600048489] [2024-11-09 06:55:26,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:26,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:26,868 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-09 06:55:26,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:26,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600048489] [2024-11-09 06:55:26,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600048489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:26,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:26,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:55:26,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504359485] [2024-11-09 06:55:26,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:26,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:26,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:26,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:26,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:26,891 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 245 [2024-11-09 06:55:26,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 217 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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-09 06:55:26,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:26,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 245 [2024-11-09 06:55:26,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:35,961 INFO L124 PetriNetUnfolderBase]: 27267/82221 cut-off events. [2024-11-09 06:55:35,962 INFO L125 PetriNetUnfolderBase]: For 2339/4240 co-relation queries the response was YES. [2024-11-09 06:55:36,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121859 conditions, 82221 events. 27267/82221 cut-off events. For 2339/4240 co-relation queries the response was YES. Maximal size of possible extension queue 1773. Compared 1093440 event pairs, 10774 based on Foata normal form. 32/74548 useless extension candidates. Maximal degree in co-relation 109328. Up to 25188 conditions per place. [2024-11-09 06:55:36,573 INFO L140 encePairwiseOnDemand]: 230/245 looper letters, 60 selfloop transitions, 10 changer transitions 0/246 dead transitions. [2024-11-09 06:55:36,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 246 transitions, 690 flow [2024-11-09 06:55:36,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:36,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:36,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 615 transitions. [2024-11-09 06:55:36,576 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8367346938775511 [2024-11-09 06:55:36,576 INFO L175 Difference]: Start difference. First operand has 224 places, 217 transitions, 471 flow. Second operand 3 states and 615 transitions. [2024-11-09 06:55:36,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 246 transitions, 690 flow [2024-11-09 06:55:36,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 246 transitions, 680 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 06:55:36,585 INFO L231 Difference]: Finished difference. Result has 221 places, 223 transitions, 535 flow [2024-11-09 06:55:36,586 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=535, PETRI_PLACES=221, PETRI_TRANSITIONS=223} [2024-11-09 06:55:36,586 INFO L277 CegarLoopForPetriNet]: 226 programPoint places, -5 predicate places. [2024-11-09 06:55:36,587 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 223 transitions, 535 flow [2024-11-09 06:55:36,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 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-09 06:55:36,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:36,587 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:36,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:55:36,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 06:55:36,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:36,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1600927801, now seen corresponding path program 1 times [2024-11-09 06:55:36,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:36,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43473576] [2024-11-09 06:55:36,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:36,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:36,624 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-09 06:55:36,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:36,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43473576] [2024-11-09 06:55:36,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43473576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:36,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:55:36,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:55:36,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022844168] [2024-11-09 06:55:36,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:36,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:36,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:36,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:36,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:55:36,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 245 [2024-11-09 06:55:36,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 223 transitions, 535 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 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-09 06:55:36,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:36,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 245 [2024-11-09 06:55:36,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:44,437 INFO L124 PetriNetUnfolderBase]: 16710/68707 cut-off events. [2024-11-09 06:55:44,438 INFO L125 PetriNetUnfolderBase]: For 4051/5311 co-relation queries the response was YES. [2024-11-09 06:55:44,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98145 conditions, 68707 events. 16710/68707 cut-off events. For 4051/5311 co-relation queries the response was YES. Maximal size of possible extension queue 1361. Compared 986987 event pairs, 11681 based on Foata normal form. 1/62403 useless extension candidates. Maximal degree in co-relation 64880. Up to 20086 conditions per place. [2024-11-09 06:55:45,080 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 33 selfloop transitions, 2 changer transitions 0/228 dead transitions. [2024-11-09 06:55:45,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 228 transitions, 615 flow [2024-11-09 06:55:45,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2024-11-09 06:55:45,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2024-11-09 06:55:45,083 INFO L175 Difference]: Start difference. First operand has 221 places, 223 transitions, 535 flow. Second operand 3 states and 609 transitions. [2024-11-09 06:55:45,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 228 transitions, 615 flow [2024-11-09 06:55:45,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 228 transitions, 595 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:55:45,107 INFO L231 Difference]: Finished difference. Result has 222 places, 224 transitions, 527 flow [2024-11-09 06:55:45,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=222, PETRI_TRANSITIONS=224} [2024-11-09 06:55:45,108 INFO L277 CegarLoopForPetriNet]: 226 programPoint places, -4 predicate places. [2024-11-09 06:55:45,108 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 224 transitions, 527 flow [2024-11-09 06:55:45,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 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-09 06:55:45,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:45,109 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:55:45,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:55:45,109 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 06:55:45,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash 566792035, now seen corresponding path program 1 times [2024-11-09 06:55:45,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:45,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025025741] [2024-11-09 06:55:45,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:45,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:55:45,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:45,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025025741] [2024-11-09 06:55:45,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025025741] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:55:45,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588394866] [2024-11-09 06:55:45,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:45,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:55:45,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:55:45,199 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:55:45,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 06:55:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:45,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 06:55:45,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:55:45,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:55:45,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:55:45,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588394866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:55:45,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 06:55:45,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-09 06:55:45,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827195283] [2024-11-09 06:55:45,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:55:45,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:55:45,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:45,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:55:45,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:55:45,301 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 245 [2024-11-09 06:55:45,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 224 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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-09 06:55:45,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:45,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 245 [2024-11-09 06:55:45,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:55:57,457 INFO L124 PetriNetUnfolderBase]: 28232/111669 cut-off events. [2024-11-09 06:55:57,457 INFO L125 PetriNetUnfolderBase]: For 1400/1400 co-relation queries the response was YES. [2024-11-09 06:55:58,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157869 conditions, 111669 events. 28232/111669 cut-off events. For 1400/1400 co-relation queries the response was YES. Maximal size of possible extension queue 2383. Compared 1723443 event pairs, 17335 based on Foata normal form. 247/102323 useless extension candidates. Maximal degree in co-relation 157810. Up to 22843 conditions per place. [2024-11-09 06:55:58,736 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 47 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2024-11-09 06:55:58,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 243 transitions, 663 flow [2024-11-09 06:55:58,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:55:58,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:55:58,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2024-11-09 06:55:58,738 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8476190476190476 [2024-11-09 06:55:58,738 INFO L175 Difference]: Start difference. First operand has 222 places, 224 transitions, 527 flow. Second operand 3 states and 623 transitions. [2024-11-09 06:55:58,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 243 transitions, 663 flow [2024-11-09 06:55:58,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 243 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:55:58,746 INFO L231 Difference]: Finished difference. Result has 224 places, 225 transitions, 537 flow [2024-11-09 06:55:58,746 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=224, PETRI_TRANSITIONS=225} [2024-11-09 06:55:58,747 INFO L277 CegarLoopForPetriNet]: 226 programPoint places, -2 predicate places. [2024-11-09 06:55:58,747 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 225 transitions, 537 flow [2024-11-09 06:55:58,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 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-09 06:55:58,747 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:55:58,747 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] [2024-11-09 06:55:58,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 06:55:58,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 06:55:58,948 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2024-11-09 06:55:58,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:55:58,948 INFO L85 PathProgramCache]: Analyzing trace with hash 827485695, now seen corresponding path program 1 times [2024-11-09 06:55:58,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:55:58,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417067526] [2024-11-09 06:55:58,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:58,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:55:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:55:59,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:55:59,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417067526] [2024-11-09 06:55:59,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417067526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:55:59,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833046964] [2024-11-09 06:55:59,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:55:59,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:55:59,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:55:59,038 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:55:59,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 06:55:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:55:59,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:55:59,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:55:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:55:59,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:55:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 06:55:59,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833046964] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:55:59,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:55:59,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-09 06:55:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153392434] [2024-11-09 06:55:59,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:55:59,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:55:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:55:59,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:55:59,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 06:55:59,444 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 245 [2024-11-09 06:55:59,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 225 transitions, 537 flow. Second operand has 10 states, 10 states have (on average 190.1) internal successors, (1901), 10 states have internal predecessors, (1901), 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-09 06:55:59,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:55:59,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 245 [2024-11-09 06:55:59,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand