./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/13_unverif.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/13_unverif.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ea403ebfe777a86c8f08ec54b02dc30e546c8fae743fed5fb0e88129df40ac76 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:47:55,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:47:55,731 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 16:47:55,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:47:55,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:47:55,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:47:55,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:47:55,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:47:55,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:47:55,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:47:55,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:47:55,773 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:47:55,774 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:47:55,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:47:55,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:47:55,776 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:47:55,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:47:55,780 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:47:55,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:47:55,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:47:55,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:47:55,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:47:55,782 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 16:47:55,782 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:47:55,782 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 16:47:55,782 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:47:55,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:47:55,783 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:47:55,783 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:47:55,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:47:55,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:47:55,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:47:55,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:47:55,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:47:55,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:47:55,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:47:55,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:47:55,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:47:55,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:47:55,788 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:47:55,788 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:47:55,788 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ea403ebfe777a86c8f08ec54b02dc30e546c8fae743fed5fb0e88129df40ac76 [2024-10-11 16:47:56,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:47:56,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:47:56,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:47:56,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:47:56,106 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:47:56,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/13_unverif.i [2024-10-11 16:47:57,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:47:57,688 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:47:57,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/13_unverif.i [2024-10-11 16:47:57,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b642eab41/621d265feba14195a6efad2c7263a41a/FLAG597d7e199 [2024-10-11 16:47:57,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/b642eab41/621d265feba14195a6efad2c7263a41a [2024-10-11 16:47:57,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:47:57,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:47:57,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:47:57,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:47:57,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:47:57,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:47:57" (1/1) ... [2024-10-11 16:47:57,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ea724f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:47:57, skipping insertion in model container [2024-10-11 16:47:57,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:47:57" (1/1) ... [2024-10-11 16:47:57,785 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:47:58,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:47:58,142 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:47:58,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:47:58,218 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:47:58,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:47:58 WrapperNode [2024-10-11 16:47:58,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:47:58,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:47:58,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:47:58,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:47:58,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:47:58" (1/1) ... [2024-10-11 16:47:58,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:47:58" (1/1) ... [2024-10-11 16:47:58,263 INFO L138 Inliner]: procedures = 167, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 60 [2024-10-11 16:47:58,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:47:58,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:47:58,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:47:58,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:47:58,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:47:58" (1/1) ... [2024-10-11 16:47:58,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:47:58" (1/1) ... [2024-10-11 16:47:58,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:47:58" (1/1) ... [2024-10-11 16:47:58,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:47:58" (1/1) ... [2024-10-11 16:47:58,280 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:47:58" (1/1) ... [2024-10-11 16:47:58,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:47:58" (1/1) ... [2024-10-11 16:47:58,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:47:58" (1/1) ... [2024-10-11 16:47:58,294 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:47:58" (1/1) ... [2024-10-11 16:47:58,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:47:58,300 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:47:58,300 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:47:58,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:47:58,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:47:58" (1/1) ... [2024-10-11 16:47:58,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:47:58,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:47:58,335 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:47:58,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:47:58,392 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-11 16:47:58,393 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-11 16:47:58,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:47:58,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 16:47:58,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:47:58,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:47:58,395 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 16:47:58,545 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:47:58,547 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:47:58,717 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 16:47:58,717 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:47:58,802 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:47:58,803 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 16:47:58,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:47:58 BoogieIcfgContainer [2024-10-11 16:47:58,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:47:58,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:47:58,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:47:58,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:47:58,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:47:57" (1/3) ... [2024-10-11 16:47:58,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c4a276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:47:58, skipping insertion in model container [2024-10-11 16:47:58,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:47:58" (2/3) ... [2024-10-11 16:47:58,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c4a276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:47:58, skipping insertion in model container [2024-10-11 16:47:58,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:47:58" (3/3) ... [2024-10-11 16:47:58,814 INFO L112 eAbstractionObserver]: Analyzing ICFG 13_unverif.i [2024-10-11 16:47:58,831 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:47:58,832 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-11 16:47:58,832 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 16:47:58,897 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 16:47:58,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 57 transitions, 118 flow [2024-10-11 16:47:58,981 INFO L124 PetriNetUnfolderBase]: 5/66 cut-off events. [2024-10-11 16:47:58,981 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 16:47:58,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 66 events. 5/66 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 81 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 44. Up to 4 conditions per place. [2024-10-11 16:47:58,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 57 transitions, 118 flow [2024-10-11 16:47:58,991 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 57 transitions, 118 flow [2024-10-11 16:47:59,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:47:59,013 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;@44cd3eba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:47:59,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-11 16:47:59,021 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 16:47:59,021 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2024-10-11 16:47:59,021 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 16:47:59,021 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:47:59,022 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:47:59,023 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 16:47:59,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:47:59,028 INFO L85 PathProgramCache]: Analyzing trace with hash -739322322, now seen corresponding path program 1 times [2024-10-11 16:47:59,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:47:59,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884421062] [2024-10-11 16:47:59,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:47:59,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:47:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:47:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:47:59,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:47:59,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884421062] [2024-10-11 16:47:59,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884421062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:47:59,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:47:59,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 16:47:59,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137305852] [2024-10-11 16:47:59,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:47:59,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:47:59,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:47:59,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:47:59,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:47:59,257 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 57 [2024-10-11 16:47:59,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 118 flow. Second operand has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:47:59,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:47:59,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 57 [2024-10-11 16:47:59,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:47:59,283 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2024-10-11 16:47:59,283 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 16:47:59,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 1/49 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 5/48 useless extension candidates. Maximal degree in co-relation 33. Up to 3 conditions per place. [2024-10-11 16:47:59,284 INFO L140 encePairwiseOnDemand]: 50/57 looper letters, 2 selfloop transitions, 0 changer transitions 0/45 dead transitions. [2024-10-11 16:47:59,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 98 flow [2024-10-11 16:47:59,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:47:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 16:47:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 103 transitions. [2024-10-11 16:47:59,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9035087719298246 [2024-10-11 16:47:59,301 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 118 flow. Second operand 2 states and 103 transitions. [2024-10-11 16:47:59,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 98 flow [2024-10-11 16:47:59,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 98 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 16:47:59,305 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 94 flow [2024-10-11 16:47:59,307 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=94, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2024-10-11 16:47:59,310 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -8 predicate places. [2024-10-11 16:47:59,311 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 94 flow [2024-10-11 16:47:59,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 48.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:47:59,311 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:47:59,311 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] [2024-10-11 16:47:59,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:47:59,312 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 16:47:59,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:47:59,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1819138702, now seen corresponding path program 1 times [2024-10-11 16:47:59,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:47:59,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389872826] [2024-10-11 16:47:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:47:59,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:47:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:47:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:47:59,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:47:59,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389872826] [2024-10-11 16:47:59,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389872826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:47:59,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:47:59,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:47:59,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972063182] [2024-10-11 16:47:59,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:47:59,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:47:59,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:47:59,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:47:59,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:47:59,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 57 [2024-10-11 16:47:59,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:47:59,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:47:59,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 57 [2024-10-11 16:47:59,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:47:59,436 INFO L124 PetriNetUnfolderBase]: 1/48 cut-off events. [2024-10-11 16:47:59,437 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 16:47:59,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 48 events. 1/48 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 54. Up to 3 conditions per place. [2024-10-11 16:47:59,437 INFO L140 encePairwiseOnDemand]: 55/57 looper letters, 3 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2024-10-11 16:47:59,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 100 flow [2024-10-11 16:47:59,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:47:59,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:47:59,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2024-10-11 16:47:59,440 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8011695906432749 [2024-10-11 16:47:59,440 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 94 flow. Second operand 3 states and 137 transitions. [2024-10-11 16:47:59,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 100 flow [2024-10-11 16:47:59,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 100 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 16:47:59,444 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 94 flow [2024-10-11 16:47:59,444 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=57, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2024-10-11 16:47:59,445 INFO L277 CegarLoopForPetriNet]: 56 programPoint places, -7 predicate places. [2024-10-11 16:47:59,446 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 94 flow [2024-10-11 16:47:59,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:47:59,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:47:59,447 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:47:59,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:47:59,448 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2024-10-11 16:47:59,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:47:59,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1900592953, now seen corresponding path program 1 times [2024-10-11 16:47:59,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:47:59,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857853582] [2024-10-11 16:47:59,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:47:59,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:47:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 16:47:59,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 16:47:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 16:47:59,506 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 16:47:59,506 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 16:47:59,507 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2024-10-11 16:47:59,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2024-10-11 16:47:59,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2024-10-11 16:47:59,509 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2024-10-11 16:47:59,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2024-10-11 16:47:59,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2024-10-11 16:47:59,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2024-10-11 16:47:59,510 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2024-10-11 16:47:59,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2024-10-11 16:47:59,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2024-10-11 16:47:59,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2024-10-11 16:47:59,511 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2024-10-11 16:47:59,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2024-10-11 16:47:59,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2024-10-11 16:47:59,512 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2024-10-11 16:47:59,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:47:59,513 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 16:47:59,516 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 16:47:59,516 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 16:47:59,564 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 16:47:59,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 89 places, 91 transitions, 192 flow [2024-10-11 16:47:59,585 INFO L124 PetriNetUnfolderBase]: 9/111 cut-off events. [2024-10-11 16:47:59,586 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 16:47:59,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 111 events. 9/111 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 233 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 77. Up to 6 conditions per place. [2024-10-11 16:47:59,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 91 transitions, 192 flow [2024-10-11 16:47:59,589 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 91 transitions, 192 flow [2024-10-11 16:47:59,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:47:59,591 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;@44cd3eba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:47:59,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-11 16:47:59,599 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 16:47:59,600 INFO L124 PetriNetUnfolderBase]: 2/26 cut-off events. [2024-10-11 16:47:59,600 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 16:47:59,600 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:47:59,600 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:47:59,604 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-11 16:47:59,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:47:59,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1028070505, now seen corresponding path program 1 times [2024-10-11 16:47:59,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:47:59,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297982938] [2024-10-11 16:47:59,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:47:59,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:47:59,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:47:59,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:47:59,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:47:59,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297982938] [2024-10-11 16:47:59,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297982938] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:47:59,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:47:59,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 16:47:59,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083773474] [2024-10-11 16:47:59,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:47:59,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:47:59,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:47:59,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:47:59,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:47:59,646 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2024-10-11 16:47:59,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 91 transitions, 192 flow. Second operand has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:47:59,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:47:59,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2024-10-11 16:47:59,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:47:59,684 INFO L124 PetriNetUnfolderBase]: 6/132 cut-off events. [2024-10-11 16:47:59,685 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-11 16:47:59,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 132 events. 6/132 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 383 event pairs, 2 based on Foata normal form. 15/122 useless extension candidates. Maximal degree in co-relation 87. Up to 9 conditions per place. [2024-10-11 16:47:59,689 INFO L140 encePairwiseOnDemand]: 79/91 looper letters, 4 selfloop transitions, 0 changer transitions 0/72 dead transitions. [2024-10-11 16:47:59,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 72 transitions, 162 flow [2024-10-11 16:47:59,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:47:59,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 16:47:59,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 162 transitions. [2024-10-11 16:47:59,694 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8901098901098901 [2024-10-11 16:47:59,694 INFO L175 Difference]: Start difference. First operand has 89 places, 91 transitions, 192 flow. Second operand 2 states and 162 transitions. [2024-10-11 16:47:59,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 72 transitions, 162 flow [2024-10-11 16:47:59,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 72 transitions, 162 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 16:47:59,697 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 154 flow [2024-10-11 16:47:59,698 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=154, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2024-10-11 16:47:59,699 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -13 predicate places. [2024-10-11 16:47:59,699 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 154 flow [2024-10-11 16:47:59,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 74.0) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:47:59,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:47:59,701 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] [2024-10-11 16:47:59,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:47:59,701 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-11 16:47:59,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:47:59,702 INFO L85 PathProgramCache]: Analyzing trace with hash 133290093, now seen corresponding path program 1 times [2024-10-11 16:47:59,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:47:59,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826700107] [2024-10-11 16:47:59,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:47:59,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:47:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:47:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:47:59,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:47:59,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826700107] [2024-10-11 16:47:59,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826700107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:47:59,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:47:59,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:47:59,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665261544] [2024-10-11 16:47:59,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:47:59,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:47:59,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:47:59,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:47:59,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:47:59,773 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 91 [2024-10-11 16:47:59,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:47:59,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:47:59,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 91 [2024-10-11 16:47:59,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:47:59,840 INFO L124 PetriNetUnfolderBase]: 24/285 cut-off events. [2024-10-11 16:47:59,841 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-10-11 16:47:59,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 285 events. 24/285 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1488 event pairs, 5 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 343. Up to 30 conditions per place. [2024-10-11 16:47:59,846 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 11 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2024-10-11 16:47:59,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 79 transitions, 207 flow [2024-10-11 16:47:59,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:47:59,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:47:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 220 transitions. [2024-10-11 16:47:59,851 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8058608058608059 [2024-10-11 16:47:59,851 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 154 flow. Second operand 3 states and 220 transitions. [2024-10-11 16:47:59,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 79 transitions, 207 flow [2024-10-11 16:47:59,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 79 transitions, 207 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 16:47:59,854 INFO L231 Difference]: Finished difference. Result has 80 places, 78 transitions, 206 flow [2024-10-11 16:47:59,854 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=80, PETRI_TRANSITIONS=78} [2024-10-11 16:47:59,855 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -9 predicate places. [2024-10-11 16:47:59,855 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 78 transitions, 206 flow [2024-10-11 16:47:59,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:47:59,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:47:59,856 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:47:59,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:47:59,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-11 16:47:59,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:47:59,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1999245585, now seen corresponding path program 1 times [2024-10-11 16:47:59,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:47:59,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937559436] [2024-10-11 16:47:59,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:47:59,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:47:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:47:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:47:59,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:47:59,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937559436] [2024-10-11 16:47:59,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937559436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:47:59,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:47:59,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:47:59,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341646252] [2024-10-11 16:47:59,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:47:59,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:47:59,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:47:59,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:47:59,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:47:59,960 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 91 [2024-10-11 16:47:59,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 78 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:47:59,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:47:59,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 91 [2024-10-11 16:47:59,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:48:00,079 INFO L124 PetriNetUnfolderBase]: 89/495 cut-off events. [2024-10-11 16:48:00,079 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-10-11 16:48:00,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 802 conditions, 495 events. 89/495 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2786 event pairs, 18 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 795. Up to 150 conditions per place. [2024-10-11 16:48:00,084 INFO L140 encePairwiseOnDemand]: 77/91 looper letters, 23 selfloop transitions, 10 changer transitions 0/91 dead transitions. [2024-10-11 16:48:00,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 91 transitions, 311 flow [2024-10-11 16:48:00,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:48:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:48:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 212 transitions. [2024-10-11 16:48:00,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7765567765567766 [2024-10-11 16:48:00,086 INFO L175 Difference]: Start difference. First operand has 80 places, 78 transitions, 206 flow. Second operand 3 states and 212 transitions. [2024-10-11 16:48:00,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 91 transitions, 311 flow [2024-10-11 16:48:00,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 91 transitions, 295 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:48:00,090 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 282 flow [2024-10-11 16:48:00,090 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=282, PETRI_PLACES=82, PETRI_TRANSITIONS=88} [2024-10-11 16:48:00,090 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -7 predicate places. [2024-10-11 16:48:00,091 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 282 flow [2024-10-11 16:48:00,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:48:00,091 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:48:00,091 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:48:00,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:48:00,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-11 16:48:00,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:48:00,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1039940466, now seen corresponding path program 1 times [2024-10-11 16:48:00,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:48:00,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748435058] [2024-10-11 16:48:00,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:48:00,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:48:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:48:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:48:00,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:48:00,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748435058] [2024-10-11 16:48:00,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748435058] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:48:00,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:48:00,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:48:00,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886392011] [2024-10-11 16:48:00,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:48:00,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:48:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:48:00,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:48:00,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:48:00,190 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 91 [2024-10-11 16:48:00,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 282 flow. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:48:00,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:48:00,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 91 [2024-10-11 16:48:00,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:48:00,276 INFO L124 PetriNetUnfolderBase]: 117/545 cut-off events. [2024-10-11 16:48:00,277 INFO L125 PetriNetUnfolderBase]: For 294/304 co-relation queries the response was YES. [2024-10-11 16:48:00,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 545 events. 117/545 cut-off events. For 294/304 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3065 event pairs, 29 based on Foata normal form. 2/472 useless extension candidates. Maximal degree in co-relation 1101. Up to 165 conditions per place. [2024-10-11 16:48:00,283 INFO L140 encePairwiseOnDemand]: 84/91 looper letters, 20 selfloop transitions, 10 changer transitions 0/97 dead transitions. [2024-10-11 16:48:00,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 97 transitions, 387 flow [2024-10-11 16:48:00,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:48:00,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:48:00,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2024-10-11 16:48:00,285 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7802197802197802 [2024-10-11 16:48:00,286 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 282 flow. Second operand 3 states and 213 transitions. [2024-10-11 16:48:00,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 97 transitions, 387 flow [2024-10-11 16:48:00,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 97 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:48:00,292 INFO L231 Difference]: Finished difference. Result has 84 places, 95 transitions, 344 flow [2024-10-11 16:48:00,294 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=84, PETRI_TRANSITIONS=95} [2024-10-11 16:48:00,295 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -5 predicate places. [2024-10-11 16:48:00,295 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 95 transitions, 344 flow [2024-10-11 16:48:00,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:48:00,295 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:48:00,296 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:48:00,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:48:00,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-11 16:48:00,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:48:00,296 INFO L85 PathProgramCache]: Analyzing trace with hash -589081368, now seen corresponding path program 1 times [2024-10-11 16:48:00,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:48:00,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927348592] [2024-10-11 16:48:00,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:48:00,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:48:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 16:48:00,314 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 16:48:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 16:48:00,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 16:48:00,330 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 16:48:00,331 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2024-10-11 16:48:00,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2024-10-11 16:48:00,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2024-10-11 16:48:00,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2024-10-11 16:48:00,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2024-10-11 16:48:00,334 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2024-10-11 16:48:00,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2024-10-11 16:48:00,336 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2024-10-11 16:48:00,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2024-10-11 16:48:00,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2024-10-11 16:48:00,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2024-10-11 16:48:00,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2024-10-11 16:48:00,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2024-10-11 16:48:00,337 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2024-10-11 16:48:00,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2024-10-11 16:48:00,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2024-10-11 16:48:00,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2024-10-11 16:48:00,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2024-10-11 16:48:00,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2024-10-11 16:48:00,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2024-10-11 16:48:00,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2024-10-11 16:48:00,339 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2024-10-11 16:48:00,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 16:48:00,339 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 16:48:00,341 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 16:48:00,341 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 16:48:00,378 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 16:48:00,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 125 transitions, 268 flow [2024-10-11 16:48:00,400 INFO L124 PetriNetUnfolderBase]: 13/156 cut-off events. [2024-10-11 16:48:00,400 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 16:48:00,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 156 events. 13/156 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 408 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 115. Up to 8 conditions per place. [2024-10-11 16:48:00,401 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 125 transitions, 268 flow [2024-10-11 16:48:00,403 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 125 transitions, 268 flow [2024-10-11 16:48:00,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:48:00,407 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;@44cd3eba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:48:00,407 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2024-10-11 16:48:00,410 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 16:48:00,410 INFO L124 PetriNetUnfolderBase]: 2/28 cut-off events. [2024-10-11 16:48:00,410 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 16:48:00,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:48:00,414 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:48:00,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2024-10-11 16:48:00,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:48:00,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1473102981, now seen corresponding path program 1 times [2024-10-11 16:48:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:48:00,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46493123] [2024-10-11 16:48:00,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:48:00,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:48:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:48:00,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:48:00,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:48:00,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46493123] [2024-10-11 16:48:00,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46493123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:48:00,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:48:00,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 16:48:00,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004570810] [2024-10-11 16:48:00,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:48:00,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:48:00,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:48:00,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:48:00,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:48:00,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 125 [2024-10-11 16:48:00,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 125 transitions, 268 flow. Second operand has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:48:00,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:48:00,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 125 [2024-10-11 16:48:00,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:48:00,484 INFO L124 PetriNetUnfolderBase]: 21/317 cut-off events. [2024-10-11 16:48:00,484 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-11 16:48:00,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 317 events. 21/317 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1620 event pairs, 10 based on Foata normal form. 37/285 useless extension candidates. Maximal degree in co-relation 197. Up to 25 conditions per place. [2024-10-11 16:48:00,487 INFO L140 encePairwiseOnDemand]: 108/125 looper letters, 6 selfloop transitions, 0 changer transitions 0/99 dead transitions. [2024-10-11 16:48:00,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 99 transitions, 228 flow [2024-10-11 16:48:00,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:48:00,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-10-11 16:48:00,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 221 transitions. [2024-10-11 16:48:00,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.884 [2024-10-11 16:48:00,489 INFO L175 Difference]: Start difference. First operand has 122 places, 125 transitions, 268 flow. Second operand 2 states and 221 transitions. [2024-10-11 16:48:00,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 99 transitions, 228 flow [2024-10-11 16:48:00,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 99 transitions, 226 flow, removed 1 selfloop flow, removed 0 redundant places. [2024-10-11 16:48:00,493 INFO L231 Difference]: Finished difference. Result has 104 places, 99 transitions, 214 flow [2024-10-11 16:48:00,493 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=214, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2024-10-11 16:48:00,494 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -18 predicate places. [2024-10-11 16:48:00,495 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 99 transitions, 214 flow [2024-10-11 16:48:00,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.0) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:48:00,495 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:48:00,495 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] [2024-10-11 16:48:00,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 16:48:00,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2024-10-11 16:48:00,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:48:00,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1687226071, now seen corresponding path program 1 times [2024-10-11 16:48:00,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:48:00,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393573371] [2024-10-11 16:48:00,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:48:00,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:48:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:48:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:48:00,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:48:00,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393573371] [2024-10-11 16:48:00,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393573371] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:48:00,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:48:00,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:48:00,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309710549] [2024-10-11 16:48:00,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:48:00,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:48:00,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:48:00,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:48:00,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:48:00,546 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 125 [2024-10-11 16:48:00,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 99 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:48:00,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:48:00,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 125 [2024-10-11 16:48:00,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:48:00,765 INFO L124 PetriNetUnfolderBase]: 274/1764 cut-off events. [2024-10-11 16:48:00,765 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2024-10-11 16:48:00,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2262 conditions, 1764 events. 274/1764 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 16557 event pairs, 67 based on Foata normal form. 0/1398 useless extension candidates. Maximal degree in co-relation 2256. Up to 271 conditions per place. [2024-10-11 16:48:00,782 INFO L140 encePairwiseOnDemand]: 113/125 looper letters, 17 selfloop transitions, 9 changer transitions 0/110 dead transitions. [2024-10-11 16:48:00,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 110 transitions, 298 flow [2024-10-11 16:48:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:48:00,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:48:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2024-10-11 16:48:00,783 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7973333333333333 [2024-10-11 16:48:00,784 INFO L175 Difference]: Start difference. First operand has 104 places, 99 transitions, 214 flow. Second operand 3 states and 299 transitions. [2024-10-11 16:48:00,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 110 transitions, 298 flow [2024-10-11 16:48:00,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 110 transitions, 298 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 16:48:00,786 INFO L231 Difference]: Finished difference. Result has 108 places, 108 transitions, 292 flow [2024-10-11 16:48:00,788 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=292, PETRI_PLACES=108, PETRI_TRANSITIONS=108} [2024-10-11 16:48:00,789 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -14 predicate places. [2024-10-11 16:48:00,790 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 108 transitions, 292 flow [2024-10-11 16:48:00,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:48:00,790 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:48:00,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] [2024-10-11 16:48:00,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 16:48:00,791 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err4ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2024-10-11 16:48:00,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:48:00,791 INFO L85 PathProgramCache]: Analyzing trace with hash -149149296, now seen corresponding path program 1 times [2024-10-11 16:48:00,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:48:00,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321356052] [2024-10-11 16:48:00,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:48:00,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:48:00,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:48:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:48:00,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:48:00,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321356052] [2024-10-11 16:48:00,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321356052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:48:00,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:48:00,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:48:00,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424874355] [2024-10-11 16:48:00,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:48:00,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:48:00,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:48:00,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:48:00,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:48:00,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2024-10-11 16:48:00,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 108 transitions, 292 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:48:00,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:48:00,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2024-10-11 16:48:00,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:48:01,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][103], [38#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 60#L699-1true, Black: 127#true, 39#L709-4true, 6#L701-2true, 123#true, 134#(= |#race~s~0| 0), 129#(= |#race~r~0| 0), 125#true, 121#true, 119#true]) [2024-10-11 16:48:01,693 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is cut-off event [2024-10-11 16:48:01,693 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2024-10-11 16:48:01,693 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2024-10-11 16:48:01,693 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2024-10-11 16:48:01,794 INFO L124 PetriNetUnfolderBase]: 2449/7998 cut-off events. [2024-10-11 16:48:01,795 INFO L125 PetriNetUnfolderBase]: For 1543/1543 co-relation queries the response was YES. [2024-10-11 16:48:01,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13837 conditions, 7998 events. 2449/7998 cut-off events. For 1543/1543 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 84217 event pairs, 629 based on Foata normal form. 0/6842 useless extension candidates. Maximal degree in co-relation 13829. Up to 3187 conditions per place. [2024-10-11 16:48:01,878 INFO L140 encePairwiseOnDemand]: 104/125 looper letters, 38 selfloop transitions, 15 changer transitions 0/131 dead transitions. [2024-10-11 16:48:01,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 131 transitions, 472 flow [2024-10-11 16:48:01,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:48:01,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:48:01,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2024-10-11 16:48:01,882 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7653333333333333 [2024-10-11 16:48:01,882 INFO L175 Difference]: Start difference. First operand has 108 places, 108 transitions, 292 flow. Second operand 3 states and 287 transitions. [2024-10-11 16:48:01,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 131 transitions, 472 flow [2024-10-11 16:48:01,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 131 transitions, 448 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:48:01,888 INFO L231 Difference]: Finished difference. Result has 110 places, 123 transitions, 406 flow [2024-10-11 16:48:01,888 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=110, PETRI_TRANSITIONS=123} [2024-10-11 16:48:01,889 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -12 predicate places. [2024-10-11 16:48:01,893 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 123 transitions, 406 flow [2024-10-11 16:48:01,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:48:01,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:48:01,894 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:48:01,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 16:48:01,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err5ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2024-10-11 16:48:01,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:48:01,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1403843795, now seen corresponding path program 1 times [2024-10-11 16:48:01,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:48:01,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537178163] [2024-10-11 16:48:01,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:48:01,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:48:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:48:01,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:48:01,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:48:01,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537178163] [2024-10-11 16:48:01,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537178163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:48:01,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:48:01,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:48:01,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047471487] [2024-10-11 16:48:01,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:48:01,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:48:01,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:48:01,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:48:01,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:48:01,977 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 125 [2024-10-11 16:48:01,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 123 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:48:01,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:48:01,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 125 [2024-10-11 16:48:01,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:48:02,656 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][115], [60#L699-1true, Black: 127#true, 39#L709-4true, Black: 132#true, 137#true, 123#true, 91#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 134#(= |#race~s~0| 0), 68#L699-5true, 125#true, 121#true, 119#true]) [2024-10-11 16:48:02,656 INFO L294 olderBase$Statistics]: this new event has 63 ancestors and is cut-off event [2024-10-11 16:48:02,656 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2024-10-11 16:48:02,656 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2024-10-11 16:48:02,657 INFO L297 olderBase$Statistics]: existing Event has 53 ancestors and is cut-off event [2024-10-11 16:48:02,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][138], [60#L699-1true, Black: 127#true, Black: 132#true, 39#L709-4true, 73#L700true, 137#true, 123#true, 6#L701-2true, 134#(= |#race~s~0| 0), 125#true, 121#true, 119#true]) [2024-10-11 16:48:02,661 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,661 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,661 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,661 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,689 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][115], [60#L699-1true, Black: 127#true, Black: 132#true, 39#L709-4true, 73#L700true, 137#true, 123#true, 91#thr1Err3ASSERT_VIOLATIONDATA_RACEtrue, 134#(= |#race~s~0| 0), 125#true, 121#true, 119#true]) [2024-10-11 16:48:02,689 INFO L294 olderBase$Statistics]: this new event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,689 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2024-10-11 16:48:02,689 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2024-10-11 16:48:02,689 INFO L297 olderBase$Statistics]: existing Event has 54 ancestors and is cut-off event [2024-10-11 16:48:02,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][136], [17#L699-1true, Black: 127#true, Black: 132#true, 39#L709-4true, 73#L700true, 137#true, 70#L699-2true, 123#true, 134#(= |#race~s~0| 0), 125#true, 121#true, 119#true]) [2024-10-11 16:48:02,773 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is cut-off event [2024-10-11 16:48:02,773 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2024-10-11 16:48:02,773 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-10-11 16:48:02,773 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2024-10-11 16:48:02,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][138], [60#L699-1true, Black: 127#true, Black: 132#true, 39#L709-4true, 73#L700true, 137#true, 123#true, 134#(= |#race~s~0| 0), 56#L699-2true, 125#true, 121#true, 119#true]) [2024-10-11 16:48:02,776 INFO L294 olderBase$Statistics]: this new event has 67 ancestors and is cut-off event [2024-10-11 16:48:02,776 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2024-10-11 16:48:02,776 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-10-11 16:48:02,776 INFO L297 olderBase$Statistics]: existing Event has 57 ancestors and is cut-off event [2024-10-11 16:48:02,846 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][99], [60#L699-1true, 112#L701-1true, Black: 127#true, 44#L699-2true, 39#L709-4true, Black: 132#true, 137#true, 123#true, 134#(= |#race~s~0| 0), 125#true, 121#true, 119#true]) [2024-10-11 16:48:02,846 INFO L294 olderBase$Statistics]: this new event has 69 ancestors and is cut-off event [2024-10-11 16:48:02,846 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2024-10-11 16:48:02,846 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2024-10-11 16:48:02,846 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2024-10-11 16:48:02,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][99], [60#L699-1true, Black: 127#true, Black: 132#true, 39#L709-4true, 137#true, 6#L701-2true, 123#true, 134#(= |#race~s~0| 0), 22#L699-1true, 125#true, 121#true, 119#true]) [2024-10-11 16:48:02,847 INFO L294 olderBase$Statistics]: this new event has 69 ancestors and is cut-off event [2024-10-11 16:48:02,847 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2024-10-11 16:48:02,847 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2024-10-11 16:48:02,847 INFO L297 olderBase$Statistics]: existing Event has 59 ancestors and is cut-off event [2024-10-11 16:48:02,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][99], [60#L699-1true, 112#L701-1true, Black: 127#true, 39#L709-4true, Black: 132#true, 137#true, 123#true, 134#(= |#race~s~0| 0), 13#L699-4true, 125#true, 121#true, 119#true]) [2024-10-11 16:48:02,950 INFO L294 olderBase$Statistics]: this new event has 71 ancestors and is cut-off event [2024-10-11 16:48:02,950 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2024-10-11 16:48:02,950 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-10-11 16:48:02,950 INFO L297 olderBase$Statistics]: existing Event has 61 ancestors and is cut-off event [2024-10-11 16:48:02,952 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][99], [60#L699-1true, Black: 127#true, 44#L699-2true, 39#L709-4true, Black: 132#true, 137#true, 123#true, 6#L701-2true, 134#(= |#race~s~0| 0), 125#true, 121#true, 119#true]) [2024-10-11 16:48:02,952 INFO L294 olderBase$Statistics]: this new event has 70 ancestors and is cut-off event [2024-10-11 16:48:02,952 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2024-10-11 16:48:02,952 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2024-10-11 16:48:02,952 INFO L297 olderBase$Statistics]: existing Event has 60 ancestors and is cut-off event [2024-10-11 16:48:02,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][99], [60#L699-1true, Black: 127#true, Black: 132#true, 39#L709-4true, 137#true, 123#true, 6#L701-2true, 134#(= |#race~s~0| 0), 13#L699-4true, 125#true, 121#true, 119#true]) [2024-10-11 16:48:02,964 INFO L294 olderBase$Statistics]: this new event has 72 ancestors and is cut-off event [2024-10-11 16:48:02,965 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2024-10-11 16:48:02,965 INFO L297 olderBase$Statistics]: existing Event has 72 ancestors and is cut-off event [2024-10-11 16:48:02,965 INFO L297 olderBase$Statistics]: existing Event has 62 ancestors and is cut-off event [2024-10-11 16:48:02,977 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][138], [60#L699-1true, Black: 127#true, 39#L709-4true, Black: 132#true, 73#L700true, 137#true, 6#L701-2true, 123#true, 134#(= |#race~s~0| 0), 125#true, 121#true, 119#true]) [2024-10-11 16:48:02,978 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-10-11 16:48:02,978 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,978 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,978 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,978 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,986 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([475] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][136], [17#L699-1true, 106#L701-2true, Black: 127#true, 39#L709-4true, 73#L700true, Black: 132#true, 137#true, 123#true, 134#(= |#race~s~0| 0), 125#true, 121#true, 119#true]) [2024-10-11 16:48:02,987 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-10-11 16:48:02,987 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-11 16:48:02,987 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,987 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,988 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][138], [60#L699-1true, Black: 127#true, 73#L700true, 39#L709-4true, Black: 132#true, 137#true, 6#L701-2true, 123#true, 134#(= |#race~s~0| 0), 125#true, 121#true, 119#true]) [2024-10-11 16:48:02,988 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-10-11 16:48:02,988 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,988 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,988 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,988 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-11 16:48:02,988 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,988 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][99], [60#L699-1true, Black: 127#true, 32#thr1Err5ASSERT_VIOLATIONDATA_RACEtrue, 39#L709-4true, Black: 132#true, 137#true, 6#L701-2true, 123#true, 134#(= |#race~s~0| 0), 125#true, 121#true, 119#true]) [2024-10-11 16:48:02,989 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-10-11 16:48:02,989 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,989 INFO L297 olderBase$Statistics]: existing Event has 64 ancestors and is cut-off event [2024-10-11 16:48:02,989 INFO L297 olderBase$Statistics]: existing Event has 74 ancestors and is cut-off event [2024-10-11 16:48:03,001 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][99], [60#L699-1true, 115#L701-2true, 112#L701-1true, Black: 127#true, Black: 132#true, 39#L709-4true, 137#true, 123#true, 134#(= |#race~s~0| 0), 125#true, 121#true, 119#true]) [2024-10-11 16:48:03,001 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-10-11 16:48:03,001 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2024-10-11 16:48:03,001 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2024-10-11 16:48:03,001 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2024-10-11 16:48:03,002 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][99], [60#L699-1true, Black: 127#true, 39#L709-4true, 14#L701-1true, Black: 132#true, 137#true, 123#true, 6#L701-2true, 134#(= |#race~s~0| 0), 125#true, 121#true, 119#true]) [2024-10-11 16:48:03,002 INFO L294 olderBase$Statistics]: this new event has 76 ancestors and is cut-off event [2024-10-11 16:48:03,002 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2024-10-11 16:48:03,003 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2024-10-11 16:48:03,003 INFO L297 olderBase$Statistics]: existing Event has 66 ancestors and is cut-off event [2024-10-11 16:48:03,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([409] L701-6-->L699-1: Formula: (= |v_#race~s~0_1| 0) InVars {} OutVars{#race~s~0=|v_#race~s~0_1|} AuxVars[] AssignedVars[#race~s~0][99], [60#L699-1true, 115#L701-2true, Black: 127#true, 39#L709-4true, Black: 132#true, 137#true, 123#true, 6#L701-2true, 134#(= |#race~s~0| 0), 125#true, 121#true, 119#true]) [2024-10-11 16:48:03,005 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-10-11 16:48:03,005 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-10-11 16:48:03,005 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-10-11 16:48:03,005 INFO L297 olderBase$Statistics]: existing Event has 67 ancestors and is cut-off event [2024-10-11 16:48:03,009 INFO L124 PetriNetUnfolderBase]: 3198/9522 cut-off events. [2024-10-11 16:48:03,009 INFO L125 PetriNetUnfolderBase]: For 5825/6127 co-relation queries the response was YES. [2024-10-11 16:48:03,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20797 conditions, 9522 events. 3198/9522 cut-off events. For 5825/6127 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 98660 event pairs, 894 based on Foata normal form. 51/8074 useless extension candidates. Maximal degree in co-relation 20788. Up to 3525 conditions per place. [2024-10-11 16:48:03,094 INFO L140 encePairwiseOnDemand]: 115/125 looper letters, 34 selfloop transitions, 17 changer transitions 0/144 dead transitions. [2024-10-11 16:48:03,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 144 transitions, 610 flow [2024-10-11 16:48:03,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:48:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:48:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2024-10-11 16:48:03,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7786666666666666 [2024-10-11 16:48:03,096 INFO L175 Difference]: Start difference. First operand has 110 places, 123 transitions, 406 flow. Second operand 3 states and 292 transitions. [2024-10-11 16:48:03,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 144 transitions, 610 flow [2024-10-11 16:48:03,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 144 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:48:03,109 INFO L231 Difference]: Finished difference. Result has 112 places, 138 transitions, 534 flow [2024-10-11 16:48:03,110 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=112, PETRI_TRANSITIONS=138} [2024-10-11 16:48:03,111 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -10 predicate places. [2024-10-11 16:48:03,111 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 138 transitions, 534 flow [2024-10-11 16:48:03,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:48:03,112 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:48:03,112 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:48:03,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 16:48:03,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONDATA_RACE === [thr1Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE, thr1Err2ASSERT_VIOLATIONDATA_RACE, thr1Err3ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2024-10-11 16:48:03,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:48:03,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1320643273, now seen corresponding path program 1 times [2024-10-11 16:48:03,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:48:03,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869448540] [2024-10-11 16:48:03,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:48:03,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:48:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 16:48:03,129 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 16:48:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 16:48:03,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 16:48:03,146 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 16:48:03,146 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err3ASSERT_VIOLATIONDATA_RACE (28 of 29 remaining) [2024-10-11 16:48:03,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (27 of 29 remaining) [2024-10-11 16:48:03,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 29 remaining) [2024-10-11 16:48:03,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (25 of 29 remaining) [2024-10-11 16:48:03,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (24 of 29 remaining) [2024-10-11 16:48:03,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (23 of 29 remaining) [2024-10-11 16:48:03,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (22 of 29 remaining) [2024-10-11 16:48:03,147 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (21 of 29 remaining) [2024-10-11 16:48:03,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 29 remaining) [2024-10-11 16:48:03,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (19 of 29 remaining) [2024-10-11 16:48:03,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (18 of 29 remaining) [2024-10-11 16:48:03,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (17 of 29 remaining) [2024-10-11 16:48:03,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (16 of 29 remaining) [2024-10-11 16:48:03,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (15 of 29 remaining) [2024-10-11 16:48:03,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (14 of 29 remaining) [2024-10-11 16:48:03,148 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (13 of 29 remaining) [2024-10-11 16:48:03,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 29 remaining) [2024-10-11 16:48:03,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 29 remaining) [2024-10-11 16:48:03,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (10 of 29 remaining) [2024-10-11 16:48:03,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (9 of 29 remaining) [2024-10-11 16:48:03,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (8 of 29 remaining) [2024-10-11 16:48:03,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 29 remaining) [2024-10-11 16:48:03,149 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (6 of 29 remaining) [2024-10-11 16:48:03,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (5 of 29 remaining) [2024-10-11 16:48:03,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (4 of 29 remaining) [2024-10-11 16:48:03,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (3 of 29 remaining) [2024-10-11 16:48:03,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 29 remaining) [2024-10-11 16:48:03,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 29 remaining) [2024-10-11 16:48:03,150 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (0 of 29 remaining) [2024-10-11 16:48:03,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 16:48:03,150 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-11 16:48:03,187 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2024-10-11 16:48:03,188 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 16:48:03,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 04:48:03 BasicIcfg [2024-10-11 16:48:03,198 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 16:48:03,198 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 16:48:03,198 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 16:48:03,198 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 16:48:03,199 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:47:58" (3/4) ... [2024-10-11 16:48:03,201 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 16:48:03,202 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 16:48:03,203 INFO L158 Benchmark]: Toolchain (without parser) took 5476.32ms. Allocated memory was 161.5MB in the beginning and 308.3MB in the end (delta: 146.8MB). Free memory was 106.8MB in the beginning and 115.3MB in the end (delta: -8.5MB). Peak memory consumption was 139.2MB. Max. memory is 16.1GB. [2024-10-11 16:48:03,203 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 16:48:03,203 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.57ms. Allocated memory is still 161.5MB. Free memory was 106.3MB in the beginning and 85.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-11 16:48:03,204 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.30ms. Allocated memory is still 161.5MB. Free memory was 85.4MB in the beginning and 83.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 16:48:03,204 INFO L158 Benchmark]: Boogie Preprocessor took 31.86ms. Allocated memory is still 161.5MB. Free memory was 83.3MB in the beginning and 82.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 16:48:03,204 INFO L158 Benchmark]: RCFGBuilder took 503.21ms. Allocated memory is still 161.5MB. Free memory was 82.1MB in the beginning and 66.5MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 16:48:03,204 INFO L158 Benchmark]: TraceAbstraction took 4392.25ms. Allocated memory was 161.5MB in the beginning and 308.3MB in the end (delta: 146.8MB). Free memory was 66.0MB in the beginning and 115.3MB in the end (delta: -49.3MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. [2024-10-11 16:48:03,204 INFO L158 Benchmark]: Witness Printer took 4.12ms. Allocated memory is still 308.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 16:48:03,206 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.57ms. Allocated memory is still 161.5MB. Free memory was 106.3MB in the beginning and 85.4MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.30ms. Allocated memory is still 161.5MB. Free memory was 85.4MB in the beginning and 83.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.86ms. Allocated memory is still 161.5MB. Free memory was 83.3MB in the beginning and 82.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 503.21ms. Allocated memory is still 161.5MB. Free memory was 82.1MB in the beginning and 66.5MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4392.25ms. Allocated memory was 161.5MB in the beginning and 308.3MB in the end (delta: 146.8MB). Free memory was 66.0MB in the beginning and 115.3MB in the end (delta: -49.3MB). Peak memory consumption was 99.4MB. Max. memory is 16.1GB. * Witness Printer took 4.12ms. Allocated memory is still 308.3MB. Free memory is still 115.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 698]: Data race detected Data race detected The following path leads to a data race: [L688] 0 unsigned int r = 0; VAL [r=0] [L689] 0 unsigned int s = 0; VAL [r=0, s=0] [L707] 0 pthread_t t; VAL [r=0, s=0] [L708] COND TRUE 0 1 VAL [r=0, s=0] [L709] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [r=0, s=0, t=-1] [L708] COND TRUE 0 1 VAL [r=0, s=0, t=-1] [L709] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [r=0, s=0, t=0] [L696] 1 unsigned int l = 0; VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=0, s=0] [L697] CALL 1 __VERIFIER_atomic_inc_r() [L692] EXPR 1 r!=-1 [L692] CALL 1 assume_abort_if_not(r!=-1) [L3] COND FALSE 1 !(!cond) [L692] RET 1 assume_abort_if_not(r!=-1) [L693] EXPR 1 r + 1 [L693] 1 r = r + 1 [L697] RET 1 __VERIFIER_atomic_inc_r() [L698] 1 r == 1 VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, s=0] [L696] 2 unsigned int l = 0; VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=1, s=0] [L697] CALL 2 __VERIFIER_atomic_inc_r() [L692] EXPR 2 r!=-1 [L692] CALL 2 assume_abort_if_not(r!=-1) [L3] COND FALSE 2 !(!cond) [L692] RET 2 assume_abort_if_not(r!=-1) [L693] EXPR 2 r + 1 [L693] 2 r = r + 1 [L697] RET 2 __VERIFIER_atomic_inc_r() [L698] 1 r == 1 VAL [\old(arg)={0:0}, arg={0:0}, l=0, r=2, s=0] Now there is a data race on ~r~0 between C: r = r + 1 [693] and C: r == 1 [698] - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 699]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 85 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 1 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=118occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 40 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 116 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 0.8s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 88 IncrementalHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 13 mSDtfsCounter, 88 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=4, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 94 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 147 locations, 29 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 137 IncrementalHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 19 mSDtfsCounter, 137 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=534occurred in iteration=4, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 94 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 16:48:03,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE