/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/goblint-regression/04-mutex_44-malloc_sound.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 17:17:18,879 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 17:17:18,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 17:17:18,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 17:17:18,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 17:17:18,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 17:17:18,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 17:17:18,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 17:17:18,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 17:17:19,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 17:17:19,002 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 17:17:19,002 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 17:17:19,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 17:17:19,004 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 17:17:19,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 17:17:19,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 17:17:19,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 17:17:19,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 17:17:19,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 17:17:19,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 17:17:19,005 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 17:17:19,006 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 17:17:19,006 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 17:17:19,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 17:17:19,007 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 17:17:19,007 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 17:17:19,007 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 17:17:19,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 17:17:19,008 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 17:17:19,008 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 17:17:19,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 17:17:19,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 17:17:19,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 17:17:19,009 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 17:17:19,009 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 17:17:19,010 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 17:17:19,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 17:17:19,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 17:17:19,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 17:17:19,329 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 17:17:19,330 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 17:17:19,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_44-malloc_sound.i [2023-08-25 17:17:20,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 17:17:20,780 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 17:17:20,792 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_44-malloc_sound.i [2023-08-25 17:17:20,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426124660/5134a1a04bee4917970b366560bea9d1/FLAGb5d170e9b [2023-08-25 17:17:20,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426124660/5134a1a04bee4917970b366560bea9d1 [2023-08-25 17:17:20,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 17:17:20,826 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 17:17:20,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 17:17:20,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 17:17:20,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 17:17:20,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 05:17:20" (1/1) ... [2023-08-25 17:17:20,831 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b54d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:17:20, skipping insertion in model container [2023-08-25 17:17:20,831 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 05:17:20" (1/1) ... [2023-08-25 17:17:20,890 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 17:17:21,302 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 17:17:21,312 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 17:17:21,337 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [261] [2023-08-25 17:17:21,339 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [261] [2023-08-25 17:17:21,364 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 17:17:21,414 INFO L206 MainTranslator]: Completed translation [2023-08-25 17:17:21,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:17:21 WrapperNode [2023-08-25 17:17:21,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 17:17:21,416 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 17:17:21,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 17:17:21,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 17:17:21,421 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:17:21" (1/1) ... [2023-08-25 17:17:21,449 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:17:21" (1/1) ... [2023-08-25 17:17:21,474 INFO L138 Inliner]: procedures = 263, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 62 [2023-08-25 17:17:21,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 17:17:21,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 17:17:21,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 17:17:21,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 17:17:21,482 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:17:21" (1/1) ... [2023-08-25 17:17:21,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:17:21" (1/1) ... [2023-08-25 17:17:21,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:17:21" (1/1) ... [2023-08-25 17:17:21,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:17:21" (1/1) ... [2023-08-25 17:17:21,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:17:21" (1/1) ... [2023-08-25 17:17:21,508 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:17:21" (1/1) ... [2023-08-25 17:17:21,509 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:17:21" (1/1) ... [2023-08-25 17:17:21,510 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:17:21" (1/1) ... [2023-08-25 17:17:21,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 17:17:21,513 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 17:17:21,513 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 17:17:21,513 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 17:17:21,514 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:17:21" (1/1) ... [2023-08-25 17:17:21,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 17:17:21,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:17:21,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 17:17:21,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 17:17:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure f [2023-08-25 17:17:21,570 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2023-08-25 17:17:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 17:17:21,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 17:17:21,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 17:17:21,571 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-25 17:17:21,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 17:17:21,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 17:17:21,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 17:17:21,572 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 17:17:21,698 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 17:17:21,700 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 17:17:21,901 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 17:17:21,907 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 17:17:21,907 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-25 17:17:21,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 05:17:21 BoogieIcfgContainer [2023-08-25 17:17:21,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 17:17:21,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 17:17:21,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 17:17:21,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 17:17:21,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 05:17:20" (1/3) ... [2023-08-25 17:17:21,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d72b245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 05:17:21, skipping insertion in model container [2023-08-25 17:17:21,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 05:17:21" (2/3) ... [2023-08-25 17:17:21,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d72b245 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 05:17:21, skipping insertion in model container [2023-08-25 17:17:21,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 05:17:21" (3/3) ... [2023-08-25 17:17:21,916 INFO L112 eAbstractionObserver]: Analyzing ICFG 04-mutex_44-malloc_sound.i [2023-08-25 17:17:21,935 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 17:17:21,936 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-25 17:17:21,936 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 17:17:21,999 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-25 17:17:22,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 88 transitions, 181 flow [2023-08-25 17:17:22,092 INFO L124 PetriNetUnfolderBase]: 4/87 cut-off events. [2023-08-25 17:17:22,092 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 17:17:22,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 87 events. 4/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 159 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2023-08-25 17:17:22,096 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 88 transitions, 181 flow [2023-08-25 17:17:22,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 87 places, 87 transitions, 177 flow [2023-08-25 17:17:22,106 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 17:17:22,115 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 87 transitions, 177 flow [2023-08-25 17:17:22,118 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 87 transitions, 177 flow [2023-08-25 17:17:22,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 87 transitions, 177 flow [2023-08-25 17:17:22,145 INFO L124 PetriNetUnfolderBase]: 4/87 cut-off events. [2023-08-25 17:17:22,145 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 17:17:22,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 87 events. 4/87 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 159 event pairs, 0 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 42. Up to 2 conditions per place. [2023-08-25 17:17:22,148 INFO L119 LiptonReduction]: Number of co-enabled transitions 960 [2023-08-25 17:17:23,996 INFO L134 LiptonReduction]: Checked pairs total: 3682 [2023-08-25 17:17:23,996 INFO L136 LiptonReduction]: Total number of compositions: 79 [2023-08-25 17:17:24,015 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 17:17:24,022 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@7b29c3c4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 17:17:24,022 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-25 17:17:24,024 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 17:17:24,024 INFO L124 PetriNetUnfolderBase]: 1/3 cut-off events. [2023-08-25 17:17:24,024 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 17:17:24,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:17:24,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-25 17:17:24,025 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-08-25 17:17:24,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:17:24,030 INFO L85 PathProgramCache]: Analyzing trace with hash 10082, now seen corresponding path program 1 times [2023-08-25 17:17:24,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:17:24,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913509643] [2023-08-25 17:17:24,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:17:24,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:17:24,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:17:24,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:17:24,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:17:24,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913509643] [2023-08-25 17:17:24,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913509643] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:17:24,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:17:24,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-25 17:17:24,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226426642] [2023-08-25 17:17:24,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:17:24,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 17:17:24,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:17:24,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 17:17:24,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 17:17:24,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 167 [2023-08-25 17:17:24,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 59 flow. Second operand has 2 states, 2 states have (on average 87.0) internal successors, (174), 2 states have internal predecessors, (174), 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) [2023-08-25 17:17:24,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:17:24,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 167 [2023-08-25 17:17:24,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:17:24,247 INFO L124 PetriNetUnfolderBase]: 21/79 cut-off events. [2023-08-25 17:17:24,247 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 17:17:24,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 79 events. 21/79 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 251 event pairs, 20 based on Foata normal form. 6/75 useless extension candidates. Maximal degree in co-relation 124. Up to 54 conditions per place. [2023-08-25 17:17:24,249 INFO L140 encePairwiseOnDemand]: 163/167 looper letters, 13 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-08-25 17:17:24,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 77 flow [2023-08-25 17:17:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 17:17:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 17:17:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 189 transitions. [2023-08-25 17:17:24,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5658682634730539 [2023-08-25 17:17:24,261 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 189 transitions. [2023-08-25 17:17:24,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 189 transitions. [2023-08-25 17:17:24,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:17:24,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 189 transitions. [2023-08-25 17:17:24,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 94.5) internal successors, (189), 2 states have internal predecessors, (189), 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) [2023-08-25 17:17:24,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:17:24,272 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 17:17:24,274 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 59 flow. Second operand 2 states and 189 transitions. [2023-08-25 17:17:24,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 77 flow [2023-08-25 17:17:24,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 24 transitions, 76 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 17:17:24,278 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 50 flow [2023-08-25 17:17:24,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=50, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2023-08-25 17:17:24,282 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2023-08-25 17:17:24,282 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 50 flow [2023-08-25 17:17:24,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.0) internal successors, (174), 2 states have internal predecessors, (174), 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) [2023-08-25 17:17:24,283 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:17:24,283 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-25 17:17:24,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 17:17:24,283 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-08-25 17:17:24,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:17:24,284 INFO L85 PathProgramCache]: Analyzing trace with hash 709137513, now seen corresponding path program 1 times [2023-08-25 17:17:24,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:17:24,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303526412] [2023-08-25 17:17:24,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:17:24,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:17:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:17:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:17:24,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:17:24,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303526412] [2023-08-25 17:17:24,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303526412] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:17:24,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 17:17:24,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 17:17:24,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265951431] [2023-08-25 17:17:24,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:17:24,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 17:17:24,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:17:24,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 17:17:24,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 17:17:24,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 167 [2023-08-25 17:17:24,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 24 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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) [2023-08-25 17:17:24,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:17:24,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 167 [2023-08-25 17:17:24,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:17:24,405 INFO L124 PetriNetUnfolderBase]: 21/80 cut-off events. [2023-08-25 17:17:24,405 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 17:17:24,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 80 events. 21/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 251 event pairs, 20 based on Foata normal form. 0/70 useless extension candidates. Maximal degree in co-relation 136. Up to 54 conditions per place. [2023-08-25 17:17:24,406 INFO L140 encePairwiseOnDemand]: 164/167 looper letters, 12 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-08-25 17:17:24,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 25 transitions, 80 flow [2023-08-25 17:17:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 17:17:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 17:17:24,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2023-08-25 17:17:24,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47904191616766467 [2023-08-25 17:17:24,409 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 240 transitions. [2023-08-25 17:17:24,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 240 transitions. [2023-08-25 17:17:24,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:17:24,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 240 transitions. [2023-08-25 17:17:24,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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) [2023-08-25 17:17:24,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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) [2023-08-25 17:17:24,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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) [2023-08-25 17:17:24,413 INFO L175 Difference]: Start difference. First operand has 27 places, 24 transitions, 50 flow. Second operand 3 states and 240 transitions. [2023-08-25 17:17:24,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 25 transitions, 80 flow [2023-08-25 17:17:24,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 80 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 17:17:24,414 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 62 flow [2023-08-25 17:17:24,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2023-08-25 17:17:24,415 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2023-08-25 17:17:24,415 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 62 flow [2023-08-25 17:17:24,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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) [2023-08-25 17:17:24,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:17:24,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:17:24,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 17:17:24,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-08-25 17:17:24,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:17:24,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1300326845, now seen corresponding path program 1 times [2023-08-25 17:17:24,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:17:24,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881015827] [2023-08-25 17:17:24,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:17:24,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:17:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:17:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:17:24,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:17:24,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881015827] [2023-08-25 17:17:24,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881015827] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:17:24,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105279591] [2023-08-25 17:17:24,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:17:24,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:17:24,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:17:24,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 17:17:24,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 17:17:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:17:24,670 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 17:17:24,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:17:24,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 17:17:24,682 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 17:17:24,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105279591] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:17:24,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 17:17:24,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-25 17:17:24,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802601500] [2023-08-25 17:17:24,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:17:24,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 17:17:24,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:17:24,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 17:17:24,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 17:17:24,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 167 [2023-08-25 17:17:24,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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) [2023-08-25 17:17:24,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:17:24,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 167 [2023-08-25 17:17:24,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:17:24,770 INFO L124 PetriNetUnfolderBase]: 78/205 cut-off events. [2023-08-25 17:17:24,770 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 17:17:24,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 205 events. 78/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 885 event pairs, 35 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 393. Up to 112 conditions per place. [2023-08-25 17:17:24,774 INFO L140 encePairwiseOnDemand]: 159/167 looper letters, 31 selfloop transitions, 6 changer transitions 0/40 dead transitions. [2023-08-25 17:17:24,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 166 flow [2023-08-25 17:17:24,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 17:17:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 17:17:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2023-08-25 17:17:24,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5189620758483033 [2023-08-25 17:17:24,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 260 transitions. [2023-08-25 17:17:24,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 260 transitions. [2023-08-25 17:17:24,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:17:24,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 260 transitions. [2023-08-25 17:17:24,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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) [2023-08-25 17:17:24,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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) [2023-08-25 17:17:24,783 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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) [2023-08-25 17:17:24,783 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 62 flow. Second operand 3 states and 260 transitions. [2023-08-25 17:17:24,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 166 flow [2023-08-25 17:17:24,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 40 transitions, 162 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-25 17:17:24,785 INFO L231 Difference]: Finished difference. Result has 33 places, 31 transitions, 110 flow [2023-08-25 17:17:24,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=33, PETRI_TRANSITIONS=31} [2023-08-25 17:17:24,786 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2023-08-25 17:17:24,786 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 31 transitions, 110 flow [2023-08-25 17:17:24,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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) [2023-08-25 17:17:24,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:17:24,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:17:24,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-25 17:17:24,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:17:24,992 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-08-25 17:17:24,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:17:24,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2002478577, now seen corresponding path program 1 times [2023-08-25 17:17:24,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:17:24,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067467490] [2023-08-25 17:17:24,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:17:24,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:17:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:17:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:17:25,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:17:25,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067467490] [2023-08-25 17:17:25,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067467490] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:17:25,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397433318] [2023-08-25 17:17:25,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:17:25,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:17:25,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:17:25,077 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 17:17:25,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 17:17:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:17:25,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 17:17:25,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:17:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 17:17:25,188 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 17:17:25,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397433318] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:17:25,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 17:17:25,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-25 17:17:25,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246061434] [2023-08-25 17:17:25,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:17:25,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 17:17:25,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:17:25,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 17:17:25,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 17:17:25,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 167 [2023-08-25 17:17:25,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 31 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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) [2023-08-25 17:17:25,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:17:25,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 167 [2023-08-25 17:17:25,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:17:25,250 INFO L124 PetriNetUnfolderBase]: 77/199 cut-off events. [2023-08-25 17:17:25,251 INFO L125 PetriNetUnfolderBase]: For 97/99 co-relation queries the response was YES. [2023-08-25 17:17:25,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 199 events. 77/199 cut-off events. For 97/99 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 818 event pairs, 46 based on Foata normal form. 2/177 useless extension candidates. Maximal degree in co-relation 492. Up to 163 conditions per place. [2023-08-25 17:17:25,252 INFO L140 encePairwiseOnDemand]: 162/167 looper letters, 30 selfloop transitions, 6 changer transitions 2/41 dead transitions. [2023-08-25 17:17:25,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 222 flow [2023-08-25 17:17:25,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 17:17:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 17:17:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2023-08-25 17:17:25,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4870259481037924 [2023-08-25 17:17:25,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 244 transitions. [2023-08-25 17:17:25,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 244 transitions. [2023-08-25 17:17:25,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:17:25,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 244 transitions. [2023-08-25 17:17:25,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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) [2023-08-25 17:17:25,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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) [2023-08-25 17:17:25,256 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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) [2023-08-25 17:17:25,256 INFO L175 Difference]: Start difference. First operand has 33 places, 31 transitions, 110 flow. Second operand 3 states and 244 transitions. [2023-08-25 17:17:25,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 222 flow [2023-08-25 17:17:25,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 17:17:25,259 INFO L231 Difference]: Finished difference. Result has 34 places, 35 transitions, 140 flow [2023-08-25 17:17:25,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=34, PETRI_TRANSITIONS=35} [2023-08-25 17:17:25,260 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2023-08-25 17:17:25,260 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 35 transitions, 140 flow [2023-08-25 17:17:25,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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) [2023-08-25 17:17:25,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:17:25,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:17:25,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-25 17:17:25,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-25 17:17:25,466 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-08-25 17:17:25,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:17:25,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1558756795, now seen corresponding path program 1 times [2023-08-25 17:17:25,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:17:25,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739765172] [2023-08-25 17:17:25,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:17:25,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:17:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:17:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:17:25,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:17:25,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739765172] [2023-08-25 17:17:25,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739765172] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:17:25,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800213115] [2023-08-25 17:17:25,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:17:25,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:17:25,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:17:25,551 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 17:17:25,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 17:17:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:17:25,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 17:17:25,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:17:25,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 17:17:25,628 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 17:17:25,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800213115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 17:17:25,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 17:17:25,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-25 17:17:25,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696169457] [2023-08-25 17:17:25,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 17:17:25,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 17:17:25,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:17:25,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 17:17:25,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 17:17:25,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 167 [2023-08-25 17:17:25,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 35 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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) [2023-08-25 17:17:25,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:17:25,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 167 [2023-08-25 17:17:25,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:17:25,689 INFO L124 PetriNetUnfolderBase]: 72/192 cut-off events. [2023-08-25 17:17:25,689 INFO L125 PetriNetUnfolderBase]: For 110/118 co-relation queries the response was YES. [2023-08-25 17:17:25,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 192 events. 72/192 cut-off events. For 110/118 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 773 event pairs, 35 based on Foata normal form. 2/173 useless extension candidates. Maximal degree in co-relation 500. Up to 151 conditions per place. [2023-08-25 17:17:25,693 INFO L140 encePairwiseOnDemand]: 162/167 looper letters, 29 selfloop transitions, 7 changer transitions 7/46 dead transitions. [2023-08-25 17:17:25,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 268 flow [2023-08-25 17:17:25,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 17:17:25,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 17:17:25,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2023-08-25 17:17:25,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49500998003992014 [2023-08-25 17:17:25,695 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 248 transitions. [2023-08-25 17:17:25,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 248 transitions. [2023-08-25 17:17:25,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:17:25,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 248 transitions. [2023-08-25 17:17:25,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 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) [2023-08-25 17:17:25,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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) [2023-08-25 17:17:25,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 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) [2023-08-25 17:17:25,697 INFO L175 Difference]: Start difference. First operand has 34 places, 35 transitions, 140 flow. Second operand 3 states and 248 transitions. [2023-08-25 17:17:25,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 268 flow [2023-08-25 17:17:25,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 17:17:25,702 INFO L231 Difference]: Finished difference. Result has 36 places, 35 transitions, 161 flow [2023-08-25 17:17:25,702 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=36, PETRI_TRANSITIONS=35} [2023-08-25 17:17:25,704 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 5 predicate places. [2023-08-25 17:17:25,704 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 35 transitions, 161 flow [2023-08-25 17:17:25,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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) [2023-08-25 17:17:25,704 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:17:25,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:17:25,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 17:17:25,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:17:25,910 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-08-25 17:17:25,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:17:25,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1928087301, now seen corresponding path program 1 times [2023-08-25 17:17:25,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:17:25,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509548068] [2023-08-25 17:17:25,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:17:25,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:17:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:17:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:17:25,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:17:25,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509548068] [2023-08-25 17:17:25,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509548068] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:17:25,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870844699] [2023-08-25 17:17:25,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:17:25,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:17:25,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:17:25,998 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 17:17:25,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 17:17:26,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:17:26,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 17:17:26,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:17:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:17:26,111 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 17:17:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:17:26,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870844699] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 17:17:26,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 17:17:26,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-25 17:17:26,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972248869] [2023-08-25 17:17:26,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 17:17:26,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 17:17:26,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:17:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 17:17:26,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 17:17:26,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 167 [2023-08-25 17:17:26,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 161 flow. Second operand has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 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) [2023-08-25 17:17:26,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:17:26,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 167 [2023-08-25 17:17:26,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:17:26,185 INFO L124 PetriNetUnfolderBase]: 35/139 cut-off events. [2023-08-25 17:17:26,185 INFO L125 PetriNetUnfolderBase]: For 169/178 co-relation queries the response was YES. [2023-08-25 17:17:26,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 139 events. 35/139 cut-off events. For 169/178 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 603 event pairs, 21 based on Foata normal form. 1/129 useless extension candidates. Maximal degree in co-relation 365. Up to 83 conditions per place. [2023-08-25 17:17:26,186 INFO L140 encePairwiseOnDemand]: 164/167 looper letters, 16 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2023-08-25 17:17:26,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 215 flow [2023-08-25 17:17:26,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 17:17:26,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 17:17:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 470 transitions. [2023-08-25 17:17:26,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.469061876247505 [2023-08-25 17:17:26,189 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 470 transitions. [2023-08-25 17:17:26,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 470 transitions. [2023-08-25 17:17:26,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:17:26,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 470 transitions. [2023-08-25 17:17:26,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.33333333333333) internal successors, (470), 6 states have internal predecessors, (470), 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) [2023-08-25 17:17:26,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 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) [2023-08-25 17:17:26,193 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 167.0) internal successors, (1169), 7 states have internal predecessors, (1169), 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) [2023-08-25 17:17:26,193 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 161 flow. Second operand 6 states and 470 transitions. [2023-08-25 17:17:26,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 215 flow [2023-08-25 17:17:26,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 17:17:26,197 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 190 flow [2023-08-25 17:17:26,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2023-08-25 17:17:26,199 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2023-08-25 17:17:26,199 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 190 flow [2023-08-25 17:17:26,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.83333333333333) internal successors, (461), 6 states have internal predecessors, (461), 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) [2023-08-25 17:17:26,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:17:26,200 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:17:26,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-25 17:17:26,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:17:26,406 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-08-25 17:17:26,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:17:26,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1095174325, now seen corresponding path program 2 times [2023-08-25 17:17:26,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:17:26,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880724129] [2023-08-25 17:17:26,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:17:26,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:17:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 17:17:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:17:26,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 17:17:26,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880724129] [2023-08-25 17:17:26,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880724129] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 17:17:26,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739103090] [2023-08-25 17:17:26,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-25 17:17:26,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:17:26,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 17:17:26,647 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 17:17:26,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-25 17:17:26,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-25 17:17:26,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 17:17:26,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-25 17:17:26,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 17:17:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:17:26,762 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 17:17:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 17:17:26,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739103090] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 17:17:26,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 17:17:26,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-25 17:17:26,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886640725] [2023-08-25 17:17:26,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 17:17:26,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-25 17:17:26,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 17:17:26,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-25 17:17:26,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-08-25 17:17:26,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 167 [2023-08-25 17:17:26,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 190 flow. Second operand has 12 states, 12 states have (on average 76.41666666666667) internal successors, (917), 12 states have internal predecessors, (917), 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) [2023-08-25 17:17:26,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 17:17:26,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 167 [2023-08-25 17:17:26,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 17:17:27,021 INFO L124 PetriNetUnfolderBase]: 35/145 cut-off events. [2023-08-25 17:17:27,021 INFO L125 PetriNetUnfolderBase]: For 137/146 co-relation queries the response was YES. [2023-08-25 17:17:27,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400 conditions, 145 events. 35/145 cut-off events. For 137/146 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 602 event pairs, 21 based on Foata normal form. 7/142 useless extension candidates. Maximal degree in co-relation 389. Up to 83 conditions per place. [2023-08-25 17:17:27,022 INFO L140 encePairwiseOnDemand]: 164/167 looper letters, 16 selfloop transitions, 11 changer transitions 0/44 dead transitions. [2023-08-25 17:17:27,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 280 flow [2023-08-25 17:17:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-25 17:17:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-25 17:17:27,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 929 transitions. [2023-08-25 17:17:27,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46357285429141715 [2023-08-25 17:17:27,026 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 929 transitions. [2023-08-25 17:17:27,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 929 transitions. [2023-08-25 17:17:27,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 17:17:27,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 929 transitions. [2023-08-25 17:17:27,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 77.41666666666667) internal successors, (929), 12 states have internal predecessors, (929), 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) [2023-08-25 17:17:27,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 167.0) internal successors, (2171), 13 states have internal predecessors, (2171), 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) [2023-08-25 17:17:27,034 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 167.0) internal successors, (2171), 13 states have internal predecessors, (2171), 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) [2023-08-25 17:17:27,034 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 190 flow. Second operand 12 states and 929 transitions. [2023-08-25 17:17:27,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 280 flow [2023-08-25 17:17:27,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 266 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-25 17:17:27,037 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 260 flow [2023-08-25 17:17:27,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=260, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2023-08-25 17:17:27,038 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2023-08-25 17:17:27,040 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 260 flow [2023-08-25 17:17:27,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 76.41666666666667) internal successors, (917), 12 states have internal predecessors, (917), 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) [2023-08-25 17:17:27,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 17:17:27,041 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 17:17:27,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-25 17:17:27,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 17:17:27,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2023-08-25 17:17:27,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 17:17:27,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1975793611, now seen corresponding path program 3 times [2023-08-25 17:17:27,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 17:17:27,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457108671] [2023-08-25 17:17:27,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 17:17:27,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 17:17:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 17:17:27,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-25 17:17:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 17:17:27,415 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-25 17:17:27,415 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-25 17:17:27,416 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location fErr0ASSERT_VIOLATIONDATA_RACE (11 of 12 remaining) [2023-08-25 17:17:27,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2023-08-25 17:17:27,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2023-08-25 17:17:27,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2023-08-25 17:17:27,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2023-08-25 17:17:27,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2023-08-25 17:17:27,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2023-08-25 17:17:27,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2023-08-25 17:17:27,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2023-08-25 17:17:27,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-25 17:17:27,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2023-08-25 17:17:27,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2023-08-25 17:17:27,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 17:17:27,420 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-25 17:17:27,425 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-25 17:17:27,425 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-25 17:17:27,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 05:17:27 BasicIcfg [2023-08-25 17:17:27,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-25 17:17:27,469 INFO L158 Benchmark]: Toolchain (without parser) took 6643.93ms. Allocated memory was 341.8MB in the beginning and 444.6MB in the end (delta: 102.8MB). Free memory was 316.4MB in the beginning and 417.0MB in the end (delta: -100.6MB). Peak memory consumption was 258.0MB. Max. memory is 16.0GB. [2023-08-25 17:17:27,470 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 341.8MB. Free memory was 318.7MB in the beginning and 318.6MB in the end (delta: 89.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 17:17:27,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 588.06ms. Allocated memory is still 341.8MB. Free memory was 315.9MB in the beginning and 288.9MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. [2023-08-25 17:17:27,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.79ms. Allocated memory is still 341.8MB. Free memory was 288.9MB in the beginning and 286.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 17:17:27,471 INFO L158 Benchmark]: Boogie Preprocessor took 37.44ms. Allocated memory is still 341.8MB. Free memory was 286.8MB in the beginning and 285.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-25 17:17:27,471 INFO L158 Benchmark]: RCFGBuilder took 396.28ms. Allocated memory is still 341.8MB. Free memory was 285.2MB in the beginning and 271.3MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-25 17:17:27,471 INFO L158 Benchmark]: TraceAbstraction took 5558.07ms. Allocated memory was 341.8MB in the beginning and 444.6MB in the end (delta: 102.8MB). Free memory was 270.5MB in the beginning and 417.0MB in the end (delta: -146.5MB). Peak memory consumption was 211.8MB. Max. memory is 16.0GB. [2023-08-25 17:17:27,472 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.14ms. Allocated memory is still 341.8MB. Free memory was 318.7MB in the beginning and 318.6MB in the end (delta: 89.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 588.06ms. Allocated memory is still 341.8MB. Free memory was 315.9MB in the beginning and 288.9MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.79ms. Allocated memory is still 341.8MB. Free memory was 288.9MB in the beginning and 286.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.44ms. Allocated memory is still 341.8MB. Free memory was 286.8MB in the beginning and 285.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 396.28ms. Allocated memory is still 341.8MB. Free memory was 285.2MB in the beginning and 271.3MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 5558.07ms. Allocated memory was 341.8MB in the beginning and 444.6MB in the end (delta: 102.8MB). Free memory was 270.5MB in the beginning and 417.0MB in the end (delta: -146.5MB). Peak memory consumption was 211.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 261]: Unsoundness Warning unspecified type, defaulting to int C: short [261] - GenericResultAtLocation [Line: 261]: Unsoundness Warning unspecified type, defaulting to int C: short [261] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 87 PlacesBefore, 31 PlacesAfterwards, 87 TransitionsBefore, 28 TransitionsAfterwards, 960 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 5 TrivialYvCompositions, 0 ConcurrentYvCompositions, 3 ChoiceCompositions, 79 TotalNumberOfCompositions, 3682 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1521, independent: 1276, independent conditional: 0, independent unconditional: 1276, dependent: 245, dependent conditional: 0, dependent unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 527, independent: 487, independent conditional: 0, independent unconditional: 487, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1521, independent: 789, independent conditional: 0, independent unconditional: 789, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 527, unknown conditional: 0, unknown unconditional: 527] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - DataRaceFoundResult [Line: 991]: Data race detected Data race detected The following path leads to a data race: [L987] 0 int glob; [L988] 0 pthread_mutex_t *p, *q; [L996] 0 pthread_t t1, t2; [L997] 0 int i; [L998] 0 pthread_mutex_t *a; [L999] 0 i=0 VAL [glob=0, i=0, p={0:0}, q={0:0}, t1={2:0}] [L999] COND TRUE 0 i < 10 [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) [L1002] COND FALSE 0 !(i==3) [L1004] COND FALSE 0 !(i==7) [L999] 0 i++ VAL [a={-6:0}, glob=0, i=1, p = a=25, p={0:0}, q = a=29, q={0:0}, t1={2:0}] [L999] COND TRUE 0 i < 10 [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) [L1002] COND FALSE 0 !(i==3) [L1004] COND FALSE 0 !(i==7) [L999] 0 i++ VAL [a={-10:0}, glob=0, i=2, p = a=25, p={0:0}, q = a=29, q={0:0}, t1={2:0}] [L999] COND TRUE 0 i < 10 [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) [L1002] COND FALSE 0 !(i==3) [L1004] COND FALSE 0 !(i==7) [L999] 0 i++ VAL [a={-1:0}, glob=0, i=3, p = a=25, p={0:0}, q = a=29, q={0:0}, t1={2:0}] [L999] COND TRUE 0 i < 10 [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) [L1002] COND TRUE 0 i==3 [L1003] 0 p = a [L1004] COND FALSE 0 !(i==7) [L999] 0 i++ VAL [a={-2:0}, glob=0, i=4, p = a=25, p={-2:0}, q = a=29, q={0:0}, t1={2:0}] [L999] COND TRUE 0 i < 10 [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) [L1002] COND FALSE 0 !(i==3) [L1004] COND FALSE 0 !(i==7) [L999] 0 i++ VAL [a={-3:0}, glob=0, i=5, p = a=25, p={-2:0}, q = a=29, q={0:0}, t1={2:0}] [L999] COND TRUE 0 i < 10 [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) [L1002] COND FALSE 0 !(i==3) [L1004] COND FALSE 0 !(i==7) [L999] 0 i++ VAL [a={-4:0}, glob=0, i=6, p = a=25, p={-2:0}, q = a=29, q={0:0}, t1={2:0}] [L999] COND TRUE 0 i < 10 [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) [L1002] COND FALSE 0 !(i==3) [L1004] COND FALSE 0 !(i==7) [L999] 0 i++ VAL [a={-5:0}, glob=0, i=7, p = a=25, p={-2:0}, q = a=29, q={0:0}, t1={2:0}] [L999] COND TRUE 0 i < 10 [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) [L1002] COND FALSE 0 !(i==3) [L1004] COND TRUE 0 i==7 [L1005] 0 q = a [L999] 0 i++ VAL [a={-8:0}, glob=0, i=8, p = a=25, p={-2:0}, q = a=29, q={-8:0}, t1={2:0}] [L999] COND TRUE 0 i < 10 [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) [L1002] COND FALSE 0 !(i==3) [L1004] COND FALSE 0 !(i==7) [L999] 0 i++ VAL [a={-9:0}, glob=0, i=9, p = a=25, p={-2:0}, q = a=29, q={-8:0}, t1={2:0}] [L999] COND TRUE 0 i < 10 [L1000] 0 a = malloc(sizeof(pthread_mutex_t)) [L1002] COND FALSE 0 !(i==3) [L1004] COND FALSE 0 !(i==7) [L999] 0 i++ VAL [a={-7:0}, glob=0, i=10, p = a=25, p={-2:0}, q = a=29, q={-8:0}, t1={2:0}] [L999] COND FALSE 0 !(i < 10) [L1007] FCALL, FORK 0 pthread_create(&t1, 0, f, 0) VAL [a={-7:0}, glob=0, i=10, p = a=25, p={-2:0}, pthread_create(&t1, 0, f, 0)=3, q = a=29, q={-8:0}, t1={2:0}, x={0:0}] [L1009] 0 glob++ VAL [a={-7:0}, glob++=0, glob=1, i=10, p = a=25, p={-2:0}, q = a=29, q={-8:0}, t1={2:0}, x={0:0}] [L991] 1 glob++ VAL [glob=1, p={-2:0}, q={-8:0}, x={0:0}, x={0:0}] [L1009] 0 glob++ VAL [a={-7:0}, glob++=0, glob++=27, glob=1, i=10, p = a=25, p={-2:0}, q = a=29, q={-8:0}, t1={2:0}, x={0:0}, x={0:0}] [L991] 1 glob++ VAL [glob=1, p={-2:0}, q={-8:0}, x={0:0}, x={0:0}] Now there is a data race on ~glob~0 between C: glob++ [1009] and C: glob++ [991] - UnprovableResult [Line: 991]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 992]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 107 locations, 12 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: 5.4s, OverallIterations: 8, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 270 IncrementalHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 23 mSDtfsCounter, 270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=7, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 139 ConstructedInterpolants, 0 QuantifiedInterpolants, 201 SizeOfPredicates, 4 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 3/39 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! [2023-08-25 17:17:27,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...